Sciweavers

5105 search results - page 47 / 1021
» An algorithm to determine peer-reviewers
Sort
View
INFORMATICALT
2007
80views more  INFORMATICALT 2007»
13 years 11 months ago
Recognition Algorithm for Diamond-Free Graphs
In this paper we recall the notion of weakly decomposition, we recall some necessary and sufficient conditions for a graph to admit such a decomposition, we introduce the recognit...
Mihai Talmaciu, Elena Nechita
CAIP
2009
Springer
155views Image Analysis» more  CAIP 2009»
14 years 5 months ago
Algorithms for the Sample Mean of Graphs
Measures of central tendency for graphs are important for protoype construction, frequent substructure mining, and multiple alignment of protein structures. This contribution propo...
Brijnesh J. Jain, Klaus Obermayer
NETWORKING
2000
14 years 10 days ago
An Algorithm for Multicast with Multiple QoS Constraints and Dynamic Membership
In this paper we present an algorithm to construct low-cost source trees for multicast with multiple QoS constraints and dynamic membership. Assuming the availability of link-state...
Aiguo Fei, Mario Gerla
ACL
1990
14 years 5 days ago
Free Indexation: Combinatorial Analysis and a Compositional Algorithm
The principle known as 'free indexation' plays an important role in the determination of the referential properties of noun phrases in the principleand-parameters langua...
Sandiway Fong
PR
2002
269views more  PR 2002»
13 years 10 months ago
A ground truth based vanishing point detection algorithm
A Bayesian probability-based vanishing point detection algorithm is presented which introduces the use of multiple features and training with ground truth data to determine vanish...
Andrew C. Gallagher