Sciweavers

322 search results - page 23 / 65
» An Efficient Solution to the Five-Point Relative Pose Proble...
Sort
View
CAL
2004
13 years 9 months ago
Exploiting Low Entropy to Reduce Wire Delay
Wires shrink less efficiently than transistors. Smaller dimensions increase relative delay and the probability of crosstalk. Solutions to this problem include adding additional lat...
Daniel Citron
WABI
2004
Springer
107views Bioinformatics» more  WABI 2004»
14 years 2 months ago
Phylogenetic Super-networks from Partial Trees
—In practice, one is often faced with incomplete phylogenetic data, such as a collection of partial trees or partial splits. This paper poses the problem of inferring a phylogene...
Daniel H. Huson, Tobias Dezulian, Tobias H. Kl&oum...
ECCV
1994
Springer
14 years 1 months ago
Markov Random Field Models in Computer Vision
A variety of computer vision problems can be optimally posed as Bayesian labeling in which the solution of a problem is dened as the maximum a posteriori (MAP) probability estimate...
Stan Z. Li
ICCAD
1999
IEEE
120views Hardware» more  ICCAD 1999»
14 years 1 months ago
Design and optimization of LC oscillators
We present a method for optimizing and automating component and transistor sizing for CMOS LC oscillators. We observe that the performance measures can be formulated as posynomial...
Maria del Mar Hershenson, Ali Hajimiri, Sunderaraj...
ECCV
1998
Springer
14 years 11 months ago
Matching Hierarchical Structures Using Association Graphs
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker