2168 search results - page 211 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
141
Voted
SPAA
2004
ACM
15 years 10 months ago
2004
ACM
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
137
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
Normalized Cut is a widely used technique for solving a
variety of problems. Although finding the optimal normalized
cut has proven to be NP-hard, spectral relaxations can
be ap...
123
Voted
ICPR
2000
IEEE
16 years 5 months ago
2000
IEEE
This paper proposes a method for face reconstruction that makes use of only a small set of feature points. Faces can be modeled by forming linear combinations of prototypes of sha...
150
click to vote
BMVC
2001
15 years 7 months ago
2001
In this paper, we propose a practical object recognition system which consists of two functional modules. The first is object extraction module using a range image, and the second...
128
Voted
NIPS
1997
15 years 6 months ago
1997
Prioritized sweeping is a model-based reinforcement learning method that attempts to focus an agent’s limited computational resources to achieve a good estimate of the value of ...