2376 search results - page 59 / 476 » More Efficient Internal-Regret-Minimizing Algorithms |
111
Voted
TIP
2010
14 years 10 months ago
2010
We present an efficient method that computes dense stereo correspondences by stochastically sampling match quality values. Nonexhaustive sampling facilitates the use of quality met...
116
Voted
ENTCS
2008
15 years 3 months ago
2008
The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately ...
155
Voted
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
Search nodes are single-purpose components of large Web search engines and their efficient implementation is critical to sustain thousands of queries per second and guarantee indi...
127
click to vote
DAC
2005
ACM
16 years 4 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
115
Voted
WWW
2007
ACM
16 years 4 months ago
2007
ACM
Recent work on incremental crawling has enabled the indexed document collection of a search engine to be more synchronized with the changing World Wide Web. However, this synchron...