Sciweavers

1813 search results - page 108 / 363
» Instance Pruning Techniques
Sort
View
JCO
2011
63views more  JCO 2011»
14 years 9 months ago
Robust multi-sensor scheduling for multi-site surveillance
This paper presents mathematical programming techniques for solving a class of multi-sensor scheduling problems. Robust optimization problems are formulated for both deterministic ...
Nikita Boyko, Timofey Turko, Vladimir Boginski, Da...
GIS
2006
ACM
16 years 7 months ago
Efficient position-independent iconic search using an R-theta index
An iconic image database is a collection of symbolic images where each image is a collection of labeled point features called icons. A method is presented to support fast position...
Charles Ben Cranston, Hanan Samet
KDD
2004
ACM
150views Data Mining» more  KDD 2004»
16 years 6 months ago
A framework for ontology-driven subspace clustering
Traditional clustering is a descriptive task that seeks to identify homogeneous groups of objects based on the values of their attributes. While domain knowledge is always the bes...
Jinze Liu, Wei Wang 0010, Jiong Yang
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
16 years 6 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li
EDBT
2008
ACM
169views Database» more  EDBT 2008»
16 years 6 months ago
Efficient online top-K retrieval with arbitrary similarity measures
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
Prasad M. Deshpande, Deepak P, Krishna Kummamuru