Sciweavers

1418 search results - page 204 / 284
» A Theory of Stream Queries
Sort
View
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
14 years 9 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
FOCS
1999
IEEE
14 years 1 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio
JCIT
2010
148views more  JCIT 2010»
13 years 3 months ago
Investigating the Performance of Naive- Bayes Classifiers and K- Nearest Neighbor Classifiers
Probability theory is the framework for making decision under uncertainty. In classification, Bayes' rule is used to calculate the probabilities of the classes and it is a bi...
Mohammed J. Islam, Q. M. Jonathan Wu, Majid Ahmadi...
IUI
2006
ACM
14 years 3 months ago
Towards intelligent QA interfaces: discourse processing for context questions
Question answering (QA) systems take users’ natural language questions and retrieve relevant answers from large repositories of free texts. Despite recent progress in QA researc...
Mingyu Sun, Joyce Y. Chai
SIGIR
2006
ACM
14 years 3 months ago
Type less, find more: fast autocompletion search with a succinct index
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
Holger Bast, Ingmar Weber