3894 search results - page 584 / 779 » Approximation Algorithms for Biclustering Problems |
135
Voted
AAAI
1996
1996
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
15 years 5 months ago
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
109
Voted
VLSI
2010
Springer
15 years 2 months ago
2010
Springer
—Multi-Vdd techniques enable application of lower supply voltage levels on cells with timing slacks. New voltage assignment, placement and voltage island partitioning methods are...
140
Voted
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
Subspace segmentation is the task of segmenting data
lying on multiple linear subspaces. Its applications in
computer vision include motion segmentation in video,
structure-from...
108
Voted
ICCV
2005
IEEE
16 years 5 months ago
2005
IEEE
A wide range of low level vision problems have been formulated in terms of finding the most probable assignment of a Markov Random Field (or equivalently the lowest energy configu...
138
Voted
ECCV
2002
Springer
16 years 5 months ago
2002
Springer
We address the problem of face recognition from a large set of images obtained over time - a task arising in many surveillance and authentication applications. A set or a sequence ...