Sciweavers

1299 search results - page 37 / 260
» Computing Minimal Diagnoses with Critical Set Algorithms
Sort
View
CVPR
2005
IEEE
15 years 11 months ago
Face Recognition with Image Sets Using Manifold Density Divergence
In many automatic face recognition applications, a set of a person's face images is available rather than a single image. In this paper, we describe a novel method for face r...
Ognjen Arandjelovic, Gregory Shakhnarovich, John F...
STACS
2010
Springer
15 years 4 months ago
Finding Induced Subgraphs via Minimal Triangulations
Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems including Minimum Fill-i...
Fedor V. Fomin, Yngve Villanger
94
Voted
PPSN
2004
Springer
15 years 3 months ago
An Improved Evaluation Function for the Bandwidth Minimization Problem
This paper introduces a new evaluation function, called δ, for the Bandwidth Minimization Problem for Graphs (BMPG). Compared with the classical β evaluation function used, our Î...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
95
Voted
ECCV
2006
Springer
15 years 11 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...
PODC
2005
ACM
15 years 3 months ago
Quorum placement in networks to minimize access delays
A quorum system is a family of sets (themselves called quorums), each pair of which intersect. In many distributed algorithms, the basic unit accessed by a client is a quorum of n...
Anupam Gupta, Bruce M. Maggs, Florian Oprea, Micha...