Sciweavers

2570 search results - page 372 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
MICCAI
2009
Springer
16 years 4 months ago
Accelerating Feature Based Registration Using the Johnson-Lindenstrauss Lemma
We introduce an efficient search strategy to substantially accelerate feature based registration. Previous feature based registration algorithms often use truncated search strategi...
Ayelet Akselrod-Ballin, Davi Bock, R. Clay Reid,...
118
Voted
WWW
2009
ACM
16 years 4 months ago
Online expansion of rare queries for sponsored search
Sponsored search systems are tasked with matching queries to relevant advertisements. The current state-of-the-art matching algorithms expand the user's query using a variety...
Andrei Z. Broder, Peter Ciccolo, Evgeniy Gabrilovi...
NOMS
2008
IEEE
15 years 9 months ago
Towards SLA-based optimal workload distribution in SANs
—Storage Area Networks (SANs) connect storage devices to servers over fast network interconnects. We consider the problem of optimal SAN configuration with the goal of meeting s...
Eray Gencay, Carsten Sinz, Wolfgang Küchlin
APPT
2003
Springer
15 years 8 months ago
Multi-scheduler Concurrency Control for Parallel Database Systems
Increase in amount of data stored and requirement of fast response time has motivated the research in Parallel Database Systems (PDS). Requirement for correctness of data still rem...
Sushant Goel, Hema Sharda, David Taniar
139
Voted
COMPGEOM
2005
ACM
15 years 5 months ago
The skip quadtree: a simple dynamic data structure for multidimensional data
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
David Eppstein, Michael T. Goodrich, Jonathan Z. S...