531 search results - page 64 / 107 » A Better Algorithm for Random k-SAT |
ASPDAC
2004
ACM
14 years 1 months ago
2004
ACM
--Octilinear interconnect is a promising technique to shorten wire lengths. We present two practical heuristic octilinear Steiner tree (OSMT) algorithms in the paper. They are both...
ISCAS
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper, we present a novel content-based image error detection and error concealment algorithm to improve the image quality degraded during its transmission over wireless c...
WDAG
1992
Springer
13 years 12 months ago
1992
Springer
Abstract. The Choice Coordination Problem with k alternatives (kCCP) was introduced by Rabin in 1982 [Rab82]. The goal is to design a wait-free protocol for n asynchronous processe...
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
Deep Belief Networks (DBNs) are hierarchical generative models which have been used successfully to model high dimensional visual data. However, they are not robust to common vari...
WICON
2008
13 years 9 months ago
2008
We study a routing problem in wireless sensor networks where sensors are duty-cycled. When sensors alternate between on and off modes, delay encountered in packet delivery due to ...