Sciweavers

9 search results - page 1 / 2
» Fast on-line index construction by geometric partitioning
Sort
View
CIKM
2005
Springer
13 years 6 months ago
Fast on-line index construction by geometric partitioning
Inverted index structures are the mainstay of modern text retrieval systems. They can be constructed quickly using off-line mergebased methods, and provide efficient support for ...
Nicholas Lester, Alistair Moffat, Justin Zobel
ISBI
2004
IEEE
14 years 5 months ago
Search Space Partitioning Using Convex Hull and Concavity Features for Fast Medical Image Retrieval
A new approach is presented for partitioning an image database by classifying and indexing the convex hull shapes and the number of region concavities. The result is a significant...
Phillip Mlsna, Nikolay Sirakov
ICC
2009
IEEE
105views Communications» more  ICC 2009»
13 years 2 months ago
Reflected Simplex Codebooks for Limited Feedback MIMO Beamforming
This paper proposes Reflected Simplex codebooks for limited feedback beamforming in multiple-input multipleoutput (MIMO) wireless systems. The codebooks are a geometric constructio...
Daniel J. Ryan, Iain B. Collings, Jean-Marc Valin
DAS
2006
Springer
13 years 8 months ago
The Restoration of Camera Documents Through Image Segmentation
This paper presents a document restoration technique that is able to flatten curled document images captured through a digital camera. The proposed method corrects camera images of...
Shijian Lu, Chew Lim Tan
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
13 years 10 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan