Sciweavers

1015 search results - page 148 / 203
» An efficient algorithm for AS path inferring
Sort
View
CVPR
2009
IEEE
15 years 3 months ago
Alphabet SOUP: A Framework for Approximate Energy Minimization
Many problems in computer vision can be modeled using conditional Markov random fields (CRF). Since finding the maximum a posteriori (MAP) solution in such models is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...
STOC
1996
ACM
92views Algorithms» more  STOC 1996»
14 years 7 days ago
Constructing Evolutionary Trees in the Presence of Polymorphic Characters
Abstract. Most phylogenetics literature and construction methods based upon characters presume monomorphism (one state per character per species), yet polymorphism (multiple states...
Maria Luisa Bonet, Cynthia A. Phillips, Tandy Warn...
AAAI
2006
13 years 9 months ago
Minimum Description Length Principle: Generators Are Preferable to Closed Patterns
The generators and the unique closed pattern of an equivalence class of itemsets share a common set of transactions. The generators are the minimal ones among the equivalent items...
Jinyan Li, Haiquan Li, Limsoon Wong, Jian Pei, Guo...
NIPS
2004
13 years 9 months ago
Incremental Learning for Visual Tracking
Most existing tracking algorithms construct a representation of a target object prior to the tracking task starts, and utilize invariant features to handle appearance variation of...
Jongwoo Lim, David A. Ross, Ruei-Sung Lin, Ming-Hs...
ICPR
2006
IEEE
14 years 9 months ago
Affine Invariant Dynamic Time Warping and its Application to Online Rotated Handwriting Recognition
Dynamic Time Warping (DTW) has been widely used to align and compare two sequences. DTW can efficiently deal with local warp or deformation between sequences. However, it can'...
Yu Qiao, Makoto Yasuhara