Sciweavers

2485 search results - page 69 / 497
» Time Bounded Frequency Computations
Sort
View
ISCA
2003
IEEE
157views Hardware» more  ISCA 2003»
15 years 9 months ago
Pipeline Damping: A Microarchitectural Technique to Reduce Inductive Noise in Supply Voltage
Scaling of CMOS technology causes the power supply voltages to fall and supply currents to rise at the same time as operating speeds are increasing. Falling supply voltages cause ...
Michael D. Powell, T. N. Vijaykumar
RECOMB
2005
Springer
16 years 4 months ago
Lower Bounds for Maximum Parsimony with Gene Order Data
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...
DAC
1994
ACM
15 years 8 months ago
Exact Minimum Cycle Times for Finite State Machines
In current research, the minimum cycle times of finite state machines are estimated by computing the delays of the combinational logic in the finite state machines. Even though th...
William K. C. Lam, Robert K. Brayton, Alberto L. S...
OPODIS
2010
15 years 2 months ago
Tardiness Bounds for Global EDF with Deadlines Different from Periods
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an a...
Jeremy Erickson, Nan Guan, Sanjoy K. Baruah
ICDM
2006
IEEE
89views Data Mining» more  ICDM 2006»
15 years 10 months ago
On the Lower Bound of Local Optimums in K-Means Algorithm
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung