Sciweavers

516 search results - page 13 / 104
» Retroactive answering of search queries
Sort
View
CCCG
2008
14 years 10 days ago
Searching for Frequent Colors in Rectangles
We study a new variant of colored orthogonal range searching problem: given a query rectangle Q all colors c, such that at least a fraction of all points in Q are of color c, mus...
Marek Karpinski, Yakov Nekrich
DBISP2P
2006
Springer
185views Database» more  DBISP2P 2006»
14 years 2 months ago
Answering Constrained k-NN Queries in Unstructured P2P Systems
The processing of k-NN queries has been studied extensively both in a centralized computing environment and in a structured P2P environment. However, the problem over an unstructur...
Bin Wang, Xiaochun Yang, Guoren Wang, Lei Chen 000...
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
12 years 1 months ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray
CIKM
2009
Springer
14 years 2 months ago
Answer typing for information retrieval
Answer typing is commonly thought of as finding appropriate responses to given questions. We extend the notion of answer typing to information retrieval to ensure results contain...
Christopher Pinchak, Davood Rafiei, Dekang Lin
CIDR
2011
401views Algorithms» more  CIDR 2011»
13 years 2 months ago
DBease: Making Databases User-Friendly and Easily Accessible
Structured query language (SQL) is a classical way to access relational databases. Although SQL is powerful to query relational databases, it is rather hard for inexperienced user...
Guoliang Li, Ju Fan, Hao Wu, Jiannan Wang, Jianhua...