2168 search results - page 155 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
165
click to vote
ECCV
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We propose a method for object category localization by partially matching edge contours to a single shape prototype of the category. Previous work in this area either re...
136
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
156
Voted
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
163
click to vote
PLDI
2005
ACM
15 years 9 months ago
2005
ACM
Speculative parallelization can provide significant sources of additional thread-level parallelism, especially for irregular applications that are hard to parallelize by conventio...
170
click to vote
CASES
2011
ACM
14 years 4 months ago
2011
ACM
Cost pressure is driving vendors of safety-critical systems to integrate previously distributed systems. One natural approach we have previous introduced is On-Demand Redundancy (...