Sciweavers

1461 search results - page 80 / 293
» The Cost of Cache-Oblivious Searching
Sort
View
PVLDB
2010
179views more  PVLDB 2010»
14 years 10 months ago
Nearest Neighbor Search with Strong Location Privacy
The tremendous growth of the Internet has significantly reduced the cost of obtaining and sharing information about individuals, raising many concerns about user privacy. Spatial...
Stavros Papadopoulos, Spiridon Bakiras, Dimitris P...
TCOM
2010
112views more  TCOM 2010»
14 years 10 months ago
On further reduction of complexity in tree pruning based sphere search
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...
Byonghyo Shim, Insung Kang
CVPR
2008
IEEE
16 years 1 months ago
Beyond sliding windows: Object localization by efficient subwindow search
Most successful object recognition systems rely on binary classification, deciding only if an object is present or not, but not providing information on the actual object location...
Christoph H. Lampert, Matthew B. Blaschko, Thomas ...
ICDE
2006
IEEE
162views Database» more  ICDE 2006»
16 years 1 months ago
Efficient Batch Top-k Search for Dictionary-based Entity Recognition
We consider the problem of speeding up Entity Recognition systems that exploit existing large databases of structured entities to improve extraction accuracy. These systems requir...
Amit Chandel, P. C. Nagesh, Sunita Sarawagi
IPMI
2005
Springer
16 years 22 days ago
Simultaneous Segmentation of Multiple Closed Surfaces Using Optimal Graph Searching
This paper presents a general graph-theoretic technique for simultaneously segmenting multiple closed surfaces in volumetric images, which employs a novel graph-construction scheme...
Kang Li, Steven Millington, Xiaodong Wu, Danny Z. ...