360 search results - page 39 / 72 » Distributed Network Querying with Bounded Approximate Cachin... |
126
Voted
VLDB
2001
ACM
15 years 8 months ago
2001
ACM
Similarity retrieval mechanisms should utilize generalized quadratic form distance functions as well as the Euclidean distance function since ellipsoid queries parameters may vary...
142
Voted
JUCS
2010
14 years 10 months ago
2010
: We address the question of how to communicate among distributed processes values such as real numbers, continuous functions and geometrical solids with arbitrary precision, yet e...
198
Voted
ESA
2010
Springer
15 years 4 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
172
Voted
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...
145
Voted
ISPD
2009
ACM
15 years 10 months ago
2009
ACM
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...