Sciweavers

950 search results - page 175 / 190
» Modified global k
Sort
View
ISCI
2007
141views more  ISCI 2007»
13 years 9 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...
CCR
2005
103views more  CCR 2005»
13 years 9 months ago
Part III: routers with very small buffers
Internet routers require buffers to hold packets during times of congestion. The buffers need to be fast, and so ideally they should be small enough to use fast memory technologie...
Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Ni...
ISCA
2005
IEEE
101views Hardware» more  ISCA 2005»
14 years 3 months ago
Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
Daeho Seo, Akif Ali, Won-Taek Lim, Nauman Rafique,...
PODC
2004
ACM
14 years 3 months ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen
ICIP
2004
IEEE
14 years 11 months ago
Robust ego-motion estimation and 3d model refinement using depth based parallax model
We present an iterative algorithm for robustly estimating the egomotion and refining and updating a coarse, noisy and partial depth map using a depth based parallax model and brig...
Amit K. Agrawal, Rama Chellappa