Sciweavers

211 search results - page 38 / 43
» Counting the number of independent sets in chordal graphs
Sort
View
CVPR
2004
IEEE
14 years 9 months ago
Efficient Belief Propagation for Early Vision
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
Pedro F. Felzenszwalb, Daniel P. Huttenlocher
VLDB
2007
ACM
225views Database» more  VLDB 2007»
14 years 7 months ago
An Approach to Optimize Data Processing in Business Processes
In order to optimize their revenues and profits, an increasing number of businesses organize their business activities in terms of business processes. Typically, they automate imp...
Marko Vrhovnik, Holger Schwarz, Oliver Suhre, Bern...
RSA
2008
94views more  RSA 2008»
13 years 7 months ago
Random mappings with exchangeable in-degrees
In this paper we introduce a new random mapping model, T ^D n , which maps the set {1, 2, ..., n} into itself. The random mapping T ^D n is constructed using a collection of excha...
Jennie C. Hansen, Jerzy Jaworski
JCB
2002
116views more  JCB 2002»
13 years 7 months ago
A Novel Approach to Remote Homology Detection: Jumping Alignments
We describe a new algorithm for protein classi cation and the detection of remote homologs. The rationale is to exploit both vertical and horizontal information of a multiple alig...
Rainer Spang, Marc Rehmsmeier, Jens Stoye
ICML
2007
IEEE
14 years 8 months ago
Learning distance function by coding similarity
We consider the problem of learning a similarity function from a set of positive equivalence constraints, i.e. 'similar' point pairs. We define the similarity in informa...
Aharon Bar-Hillel, Daphna Weinshall