Sciweavers

351 search results - page 23 / 71
» An exact method for graph coloring
Sort
View
CORR
2007
Springer
109views Education» more  CORR 2007»
13 years 7 months ago
Graph rigidity, Cyclic Belief Propagation and Point Pattern Matching
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...
Julian John McAuley, Tibério S. Caetano, Ma...
ICDE
2008
IEEE
157views Database» more  ICDE 2008»
14 years 9 months ago
TALE: A Tool for Approximate Large Graph Matching
Abstract-- Large graph datasets are common in many emerging database applications, and most notably in large-scale scientific applications. To fully exploit the wealth of informati...
Yuanyuan Tian, Jignesh M. Patel
JCB
2006
124views more  JCB 2006»
13 years 7 months ago
The Distribution of Genomic Distance between Random Genomes
We study the probability distribution of genomic distance d under the hypothesis of random gene order. We translate the random order assumption into a stochastic method for constr...
David Sankoff, Lani Haque
DM
2010
107views more  DM 2010»
13 years 7 months ago
An analytic approach to stability
The stability method is very useful for obtaining exact solutions of many extremal graph problems. Its key step is to establish the stability property which, roughly speaking, sta...
Oleg Pikhurko
ICIP
2004
IEEE
14 years 9 months ago
A generic method for generating multispectral filter arrays
The technology of color filter arrays (CFA) has been widely used in the digital camera industry since it provides several advantages like low cost, exact registration, and strong ...
Lidan Miao, Hairong Qi, Wesley E. Snyder