Sciweavers

882 search results - page 71 / 177
» Local Search for Very Large SAT Problems
Sort
View
CVPR
2008
IEEE
16 years 1 months ago
Object tracking and detection after occlusion via numerical hybrid local and global mode-seeking
Given an object model and a black-box measure of similarity between the model and candidate targets, we consider visual object tracking as a numerical optimization problem. During...
Zhaozheng Yin, Robert T. Collins
CIKM
2003
Springer
15 years 5 months ago
Categorizing web queries according to geographical locality
Web pages (and resources, in general) can be characterized according to their geographical locality. For example, a web page with general information about wildflowers could be c...
Luis Gravano, Vasileios Hatzivassiloglou, Richard ...
RECOMB
2002
Springer
16 years 5 days ago
Provably sensitive Indexing strategies for biosequence similarity search
The field of algorithms for pairwisc biosequence similarity search is dominated by heuristic methods of high efficiency but uncertain sensitivity. One reason that more formal stri...
Jeremy Buhler
PAMI
2010
276views more  PAMI 2010»
14 years 10 months ago
Local-Learning-Based Feature Selection for High-Dimensional Data Analysis
—This paper considers feature selection for data classification in the presence of a huge number of irrelevant features. We propose a new feature selection algorithm that addres...
Yijun Sun, Sinisa Todorovic, Steve Goodison
SDM
2008
SIAM
119views Data Mining» more  SDM 2008»
15 years 1 months ago
An Efficient Local Algorithm for Distributed Multivariate Regression in Peer-to-Peer Networks
This paper offers a local distributed algorithm for multivariate regression in large peer-to-peer environments. The algorithm is designed for distributed inferencing, data compact...
Kanishka Bhaduri, Hillol Kargupta