Sciweavers

1431 search results - page 41 / 287
» The complexity of random ordered structures
Sort
View
CVPR
2012
IEEE
13 years 3 days ago
Mode-seeking on graphs via random walks
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
Minsu Cho, Kyoung Mu Lee
WAW
2009
Springer
138views Algorithms» more  WAW 2009»
15 years 4 months ago
Information Theoretic Comparison of Stochastic Graph Models: Some Experiments
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
Kevin J. Lang
CVPR
2006
IEEE
15 years 11 months ago
Hidden Conditional Random Fields for Gesture Recognition
We introduce a discriminative hidden-state approach for the recognition of human gestures. Gesture sequences often have a complex underlying structure, and models that can incorpo...
Sy Bor Wang, Ariadna Quattoni, Louis-Philippe More...
COMPLEX
2009
Springer
15 years 1 months ago
A Comparative Analysis of Specific Spatial Network Topological Models
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...
Jun Wang, Gregory M. Provan
ISCAS
1999
IEEE
100views Hardware» more  ISCAS 1999»
15 years 2 months ago
Reduced complexity, high performance digital delta-sigma modulator for fractional-N frequency synthesis
This paper presents the design consideration of high order digital AZ modulators used as modulus controller for fractional-N frequency synthesizer. A third-order MASH structure (M...
Lizhong Sun, Thierry Lepley, Franck Nozahic, Amaud...