6455 search results - page 890 / 1291 » Research problems |
176
Voted
STOC
2007
ACM
16 years 7 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
194
Voted
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Distributed Constraint Optimization (DCOP) is useful for solving agent-coordination problems. Any-space DCOP search algorithms require only a small amount of memory but can be spe...
365
click to vote
Book
Markov random field (MRF) theory provides a basis for modeling contextual constraints in visual processing and interpretation. It enables us to develop optimal vision algorithms sy...
203
Voted
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Pedestrian detection is a key problem in computer vision,
with several applications including robotics, surveillance
and automotive safety. Much of the progress of the past
few ...
211
Voted
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
In this paper, we study the problem of nonnegative graph
embedding, originally investigated in [14] for reaping the
benefits from both nonnegative data factorization and the
spe...