1149 search results - page 64 / 230 » Minimally non-Pfaffian graphs |
GD
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
105
click to vote
ICMCS
2007
IEEE
15 years 6 months ago
2007
IEEE
Segmentation of video objects from background is a popular computer vision problem and has many important applications. Most existing methods are either computationally expensive ...
EOR
2008
14 years 12 months ago
2008
In this paper, a simulated annealing algorithm is presented for the Bandwidth Minimization Problem for Graphs. This algorithm is based on three distinguished features including an...
ICIP
2001
IEEE
16 years 1 months ago
2001
IEEE
Optimal mode selection for video coding is important in minimizing visual distortion given a rate constraint, and it has been studied in the literature using a single previous mac...
IRI
2007
IEEE
15 years 6 months ago
2007
IEEE
Suppose we are given a set A of activities of interest, a set O of observations, and a probability threshold p. We are interested in finding the set of all pairs (a, O ), where a...