2107 search results - page 60 / 422 » Computing Small Search Numbers in Linear Time |
124
click to vote
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
— Databases associated with keywords, can be public, private or hybrid, as a result the solutions to keyword search protocols for each type are different. In this paper, we study...
123
Voted
ICML
2008
IEEE
16 years 3 months ago
2008
IEEE
We present a reinforcement learning architecture, Dyna-2, that encompasses both samplebased learning and sample-based search, and that generalises across states during both learni...
115
Voted
ICIP
2010
IEEE
15 years 17 days ago
2010
IEEE
Direct implementations of bilateral filtering show O(r2 ) computational complexity per pixel, where r is the filter window radius. Several lower complexity methods have been devel...
113
Voted
AAAI
1990
15 years 3 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
122
Voted
ICIP
1997
IEEE
15 years 6 months ago
1997
IEEE
This is a contribution for very low bit rate video coding in real-time and software only on computers of PC class. It is based on frame replenishment with block coding using mean-...