Sciweavers

520 search results - page 51 / 104
» New Complexity Results for Classical Planning Benchmarks
Sort
View
ICDM
2005
IEEE
188views Data Mining» more  ICDM 2005»
14 years 2 months ago
Hierarchy-Regularized Latent Semantic Indexing
Organizing textual documents into a hierarchical taxonomy is a common practice in knowledge management. Beside textual features, the hierarchical structure of directories reflect...
Yi Huang, Kai Yu, Matthias Schubert, Shipeng Yu, V...
EOR
2006
130views more  EOR 2006»
13 years 8 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Roberto Montemanni
PAMI
2008
196views more  PAMI 2008»
13 years 8 months ago
Distance Learning for Similarity Estimation
In this paper, we present a general guideline to find a better distance measure for similarity estimation based on statistical analysis of distribution models and distance function...
Jie Yu, Jaume Amores, Nicu Sebe, Petia Radeva, Qi ...
DAGM
2011
Springer
12 years 8 months ago
Multiple Instance Boosting for Face Recognition in Videos
For face recognition from video streams often cues such as transcripts, subtitles or on-screen text are available. This information could be very valuable for improving the recogni...
Paul Wohlhart, Martin Köstinger, Peter M. Rot...
FOCS
1998
IEEE
14 years 23 days ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...