Sciweavers

1277 search results - page 162 / 256
» An Evaluation Approach for Dynamics-Aware Applications Using...
Sort
View
KDD
2009
ACM
169views Data Mining» more  KDD 2009»
14 years 5 months ago
On burstiness-aware search for document sequences
As the number and size of large timestamped collections (e.g. sequences of digitized newspapers, periodicals, blogs) increase, the problem of efficiently indexing and searching su...
Theodoros Lappas, Benjamin Arai, Manolis Platakis,...
FQAS
1998
Springer
118views Database» more  FQAS 1998»
14 years 3 months ago
Partial Answers for Unavailable Data Sources
Abstract. Many heterogeneous database system products and prototypes exist today; they will soon be deployed in a wide variety of environments. Most existing systems suffer from an...
Philippe Bonnet, Anthony Tomasic
NIPS
2008
14 years 6 days ago
Unsupervised Learning of Visual Sense Models for Polysemous Words
Polysemy is a problem for methods that exploit image search engines to build object category models. Existing unsupervised approaches do not take word sense into consideration. We...
Kate Saenko, Trevor Darrell
DASFAA
2010
IEEE
190views Database» more  DASFAA 2010»
14 years 2 months ago
k-Selection Query over Uncertain Data
This paper studies a new query on uncertain data, called k-selection query. Given an uncertain dataset of N objects, where each object is associated with a preference score and a p...
Xingjie Liu, Mao Ye, Jianliang Xu, Yuan Tian, Wang...
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
14 years 11 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...