Sciweavers

1328 search results - page 264 / 266
» An Optimization Algorithm for the Ordered Open-End Bin-Packi...
Sort
View
SIROCCO
2008
13 years 7 months ago
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nic...
SIGIR
2008
ACM
13 years 6 months ago
Enhancing text clustering by leveraging Wikipedia semantics
Most traditional text clustering methods are based on "bag of words" (BOW) representation based on frequency statistics in a set of documents. BOW, however, ignores the ...
Jian Hu, Lujun Fang, Yang Cao, Hua-Jun Zeng, Hua L...
TIP
2008
169views more  TIP 2008»
13 years 6 months ago
Maximum Likelihood Wavelet Density Estimation With Applications to Image and Shape Matching
Density estimation for observational data plays an integral role in a broad spectrum of applications, e.g. statistical data analysis and information-theoretic image registration. ...
Adrian M. Peter, Anand Rangarajan
SIGMOD
2009
ACM
214views Database» more  SIGMOD 2009»
14 years 6 months ago
DDE: from dewey to a fully dynamic XML labeling scheme
Labeling schemes lie at the core of query processing for many XML database management systems. Designing labeling schemes for dynamic XML documents is an important problem that ha...
Liang Xu, Tok Wang Ling, Huayu Wu, Zhifeng Bao
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
14 years 6 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang