Sciweavers

539 search results - page 50 / 108
» Recurrence relations and fast algorithms
Sort
View
104
Voted
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
16 years 23 days ago
Data-streams and histograms
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
Sudipto Guha, Nick Koudas, Kyuseok Shim
ASPDAC
2005
ACM
131views Hardware» more  ASPDAC 2005»
15 years 2 months ago
Analysis of buffered hybrid structured clock networks
- This paper presents a novel approach for fast transient analysis of buffered hybrid structured clock networks. The new method applies structure reduction and relaxed hierarchical...
Yi Zou, Qiang Zhou, Yici Cai, Xianlong Hong, Sheld...
CASES
2010
ACM
14 years 9 months ago
Optimizing energy to minimize errors in dataflow graphs using approximate adders
Approximate arithmetic is a promising, new approach to lowenergy designs while tackling reliability issues. We present a method to optimally distribute a given energy budget among...
Zvi M. Kedem, Vincent John Mooney, Kirthi Krishna ...
108
Voted
BMCBI
2006
153views more  BMCBI 2006»
15 years 16 days ago
Discovery of time-delayed gene regulatory networks based on temporal gene expression profiling
Background: It is one of the ultimate goals for modern biological research to fully elucidate the intricate interplays and the regulations of the molecular determinants that prope...
Xia Li, Shaoqi Rao, Wei Jiang, Chuanxing Li, Yun X...
WACV
2008
IEEE
15 years 6 months ago
Robust Human Pose Recognition Using Unlabelled Markers
In this paper, we tackle robust human pose recognition using unlabelled markers obtained from an optical marker-based motion capture system. A coarse-to-fine fast pose matching al...
Yi Wang, Gang Qian