Sciweavers

1162 search results - page 120 / 233
» Minimum Cycle Bases in Graphs Algorithms and Applications
Sort
View
ICCAD
2009
IEEE
117views Hardware» more  ICCAD 2009»
13 years 6 months ago
Binning optimization based on SSTA for transparently-latched circuits
With increasing process variation, binning has become an important technique to improve the values of fabricated chips, especially in high performance microprocessors where transpa...
Min Gong, Hai Zhou, Jun Tao, Xuan Zeng
COMPUTE
2010
ACM
14 years 16 days ago
Mining periodic-frequent patterns with maximum items' support constraints
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...
R. Uday Kiran, P. Krishna Reddy
ICPR
2006
IEEE
14 years 9 months ago
Multiple Objects Tracking with Multiple Hypotheses Graph Representation
We present a novel multi-object tracking algorithm based on multiple hypotheses about the trajectories of the objects. Our work is inspired by Reid's multiple hypothesis trac...
Alex Yong Sang Chia, Liyuan Li, Weimin Huang
SSS
2009
Springer
162views Control Systems» more  SSS 2009»
14 years 2 months ago
Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...
André Schumacher, Harri Haanpää
CN
2006
82views more  CN 2006»
13 years 8 months ago
A cost-minimization algorithm for fast location tracking in mobile wireless networks
Location tracking is one of the most important issues in providing real-time applications over wireless networks due to its effect to quality of service (QoS), such as end-to-end ...
Wenye Wang, Guoliang Xue