Sciweavers

3172 search results - page 215 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
ECCV
2002
Springer
16 years 8 months ago
Finding the Largest Unambiguous Component of Stereo Matching
Abstract. Stereo matching is an ill-posed problem for at least two principal reasons: (1) because of the random nature of match similarity measure and (2) because of structural amb...
Radim Sára
ICDE
2007
IEEE
161views Database» more  ICDE 2007»
16 years 8 months ago
Mining Colossal Frequent Patterns by Core Pattern Fusion
Extensive research for frequent-pattern mining in the past decade has brought forth a number of pattern mining algorithms that are both effective and efficient. However, the exist...
Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu, H...
ICDE
2004
IEEE
155views Database» more  ICDE 2004»
16 years 8 months ago
BIDE: Efficient Mining of Frequent Closed Sequences
Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter lea...
Jianyong Wang, Jiawei Han
ICIP
1998
IEEE
16 years 7 months ago
Covariant Conics Decomposition of Quartics for 2D Object Recognition and Affine Alignment
This paper outlines a geometric parameterization of 2D curves where the parameterization is in terms of geometric invariants and terms that determine an intrinsic coordinate system...
Jean-Philippe Tarel, William Wolovich and David B...
DAC
1999
ACM
16 years 7 months ago
Power Efficient Mediaprocessors: Design Space Exploration
We present a framework for rapidly exploring the design space of low power application-specific programmable processors (ASPP), in particular mediaprocessors. We focus on a catego...
Johnson Kin, Chunho Lee, William H. Mangione-Smith...