Sciweavers

3652 search results - page 115 / 731
» A study of query length
Sort
View
ICDE
2005
IEEE
139views Database» more  ICDE 2005»
14 years 9 months ago
Compressing Bitmap Indices by Data Reorganization
Many scientific applications generate massive volumes of data through observations or computer simulations, bringing up the need for effective indexing methods for efficient stora...
Ali Pinar, Tao Tao, Hakan Ferhatosmanoglu
VLDB
2007
ACM
197views Database» more  VLDB 2007»
14 years 8 months ago
Indexable PLA for Efficient Similarity Search
Similarity-based search over time-series databases has been a hot research topic for a long history, which is widely used in many applications, including multimedia retrieval, dat...
Qiuxia Chen, Lei Chen 0002, Xiang Lian, Yunhao Liu...
IV
2007
IEEE
144views Visualization» more  IV 2007»
14 years 2 months ago
Visualizing Evolving Searches with EvoBerry
Studies show that roughly one-third of searches that are performed on the web require the user to initiate subsequent searches. Bates [1] theorized that with every search the user...
Edward Suvanaphen, Jonathan C. Roberts
USS
2008
13 years 10 months ago
Panalyst: Privacy-Aware Remote Error Analysis on Commodity Software
Remote error analysis aims at timely detection and remedy of software vulnerabilities through analyzing runtime errors that occur on the client. This objective can only be achieve...
Rui Wang 0010, XiaoFeng Wang, Zhuowei Li
ESA
2003
Springer
58views Algorithms» more  ESA 2003»
14 years 1 months ago
Kinetic Dictionaries: How to Shoot a Moving Target
A kinetic dictionary is a data structure for storing a set S of continuously moving points on the real line, such that at any time we can quickly determine for a given query point ...
Mark de Berg