973 search results - page 134 / 195 » New Bounds on Crossing Numbers |
166
click to vote
AIPS
2008
15 years 8 months ago
2008
Loosely coupled multi-agent systems are perceived as easier to plan for because they require less coordination between agent sub-plans. In this paper we set out to formalize this ...
162
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
162
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
168
click to vote
NIPS
2008
15 years 7 months ago
2008
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...
170
click to vote
SODA
2000
ACM
15 years 7 months ago
2000
ACM
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...