Sciweavers

277 search results - page 43 / 56
» Opportunistic Data Structures for Range Queries
Sort
View
ICMCS
1999
IEEE
119views Multimedia» more  ICMCS 1999»
14 years 1 months ago
Indexing by Shape of Image Databases Based on Extended Grid Files
In this paper, we propose an original indexing by shape of image databases based on extended grid files. We first introduce a recently developed shape description method and tailo...
Carlo Combi, Gian Luca Foresti, Massimo Francesche...
ICSE
2008
IEEE-ACM
14 years 9 months ago
Answering conceptual queries with Ferret
Programmers seek to answer questions as they investigate the functioning of a software system, such as "which execution path is being taken in this case?" Programmers at...
Brian de Alwis, Gail C. Murphy
IM
2007
13 years 8 months ago
Inverted Index Support for Numeric Search
Today’s search engines are increasingly required to broaden their capabilities beyond free-text search. More complex features, such as supporting range constraints over numeric ...
Marcus Fontoura, Ronny Lempel, Runping Qi, Jason Y...
TKDE
2010
218views more  TKDE 2010»
13 years 3 months ago
LIGHT: A Query-Efficient Yet Low-Maintenance Indexing Scheme over DHTs
DHT is a widely used building block for scalable P2P systems. However, as uniform hashing employed in DHTs destroys data locality, it is not a trivial task to support complex queri...
Yuzhe Tang, Shuigeng Zhou, Jianliang Xu
ALGORITHMICA
2000
87views more  ALGORITHMICA 2000»
13 years 8 months ago
Linear Size Binary Space Partitions for Uncluttered Scenes
We describe a new and simple method for constructing binary space partitions in arbitrary dimensions. We also introduce the concept of uncluttered scenes, which are scenes with a ...
Mark de Berg