6365 search results - page 396 / 1273 » Fast Local Computation Algorithms |
175
click to vote
IPTPS
2005
Springer
16 years 9 days ago
2005
Springer
To improve performance, large-scale Internet systems require clients to access nearby servers. While centralized systems can leverage static topology maps for rough network distan...
203
click to vote
ECCV
2004
Springer
16 years 6 days ago
2004
Springer
Abstract. The randomness of iris pattern makes it one of the most reliable biometric traits. On the other hand, the complex iris image structure and various sources of intra-class ...
194
click to vote
AI
2003
Springer
16 years 1 days ago
2003
Springer
Sets of DNA strands that satisfy combinatorial constraints play an important role in various approaches to biomolecular computation, nanostructure design, and molecular tagging. Th...
210
click to vote
EUROPAR
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Definitions for the uniform representation of d-dimensional matrices serially in Morton-order (or Z-order) support both their use with cartesian indices, and their divide...
222
Voted
SIAMNUM
2010
15 years 1 months ago
2010
A straightforward discretisation of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like ...