2168 search results - page 209 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
122
Voted
GLOBECOM
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract—In wireless networks, monotonic, strictly subhomogeneous functions have been used to analyze power control algorithms. We provide an alternative analysis based on the ob...
162
click to vote
ECCV
2006
Springer
16 years 6 months ago
2006
Springer
In this paper, we present a novel scale- and rotation-invariant interest point detector and descriptor, coined SURF (Speeded Up Robust Features). It approximates or even outperform...
180
Voted
PODC
2006
ACM
15 years 10 months ago
2006
ACM
We present Grouped Distributed Queues (GDQ), the first proportional share scheduler for multiprocessor systems that scales well with a large number of processors and processes. G...
149
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Object detection in clutter or occlusion is a hard problem in computer vision. We propose an object detection method based on contour grouping. Two stages are included: a novel di...
159
click to vote
EDBT
2008
ACM
16 years 4 months ago
2008
ACM
Music information retrieval is becoming very important with the ever-increasing growth of music content in digital libraries, peer-to-peer systems and the internet. While it is ea...