605 search results - page 17 / 121 » Parameterized Dynamic Tables |
77
Voted
IPPS
2006
IEEE
15 years 4 months ago
2006
IEEE
Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...
MICCAI
2004
Springer
15 years 11 months ago
2004
Springer
This paper introduces the progressive attenuation field (PAF), a method to speed up computation of digitally reconstructed radiograph (DRR) images during intensity-based 2D-3D regi...
63
Voted
AAAI
2007
15 years 23 days ago
2007
In this paper, a state-based approach for the Constraint Satisfaction Problem (CSP) is proposed. The key novelty is an original use of state memorization during search to prevent ...
102
click to vote
JSA
2006
14 years 10 months ago
2006
Stringent memory access and search speed requirements are two of the main bottlenecks in wire speed processing. Most viable search engines are implemented in content addressable m...
INFOSCALE
2009
ACM
15 years 5 months ago
2009
ACM
Address Fragmentation plays a key role in the exponential growth of DFZ routing table, known as the scalability problem of current Internet. In this paper, we measure the severity ...