3223 search results - page 203 / 645 » The Scaling of Search Cost |
188
click to vote
ACCV
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. A tracking-by-detection framework is proposed that combines nearest-neighbor classification of bags of features, efficient subwindow search, and a novel feature selection...
174
click to vote
AMAI
2004
Springer
15 years 12 months ago
2004
Springer
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
181
click to vote
WIOPT
2006
IEEE
16 years 17 days ago
2006
IEEE
We consider the problem of optimizing the number of replicas for event information in wireless sensor networks, when queries are disseminated using expanding rings. We obtain clos...
155
click to vote
ISQED
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper presents a hybrid BIST architecture and methods for optimizing it to test systems-on-chip in a cost effective way. The proposed self-test architecture can be implemente...
173
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...