4926 search results - page 536 / 986 » Two Graph Algorithms On an Associative Computing Model |
196
click to vote
STOC
1997
ACM
15 years 7 months ago
1997
ACM
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
139
click to vote
CC
2009
Springer
15 years 8 months ago
2009
Springer
Single-assignment languages with copy semantics have a very simple and approachable programming model. A na¨ıve implementation of the copy semantics that copies the result of eve...
144
Voted
COSIT
2003
Springer
15 years 8 months ago
2003
Springer
Numerous cognitive studies have indicated that the form and complexity of route instructions may be as important to human navigators as the overall length of route. Most automated ...
150
Voted
TCBB
2011
14 years 10 months ago
2011
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...
105
Voted
ISQED
2006
IEEE
15 years 9 months ago
2006
IEEE
— In this paper, we propose an efficient model order reduction (MOR) algorithm, called MTermMOR, for modeling interconnect circuits with large number of external ports. The prop...