493 search results - page 70 / 99 » Quantum Query Complexity of Some Graph Problems |
81
Voted
CVPR
2010
IEEE
15 years 2 months ago
2010
IEEE
Optimum subwindow search for object detection aims to find a subwindow so that the contained subimage is most similar to the query object. This problem can be formulated as a fou...
129
click to vote
ALT
1995
Springer
15 years 5 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
125
click to vote
IPPS
2009
IEEE
15 years 8 months ago
2009
IEEE
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
101
Voted
DBPL
2003
Springer
15 years 7 months ago
2003
Springer
The increased usage of mobile devices coupled with an unprecedented demand for information has pushed the scalability problem of pull-based data service to the focus. A broadcast ...
127
click to vote
MOBIHOC
2007
ACM
16 years 1 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...