Sciweavers

4164 search results - page 145 / 833
» Timing model reduction for hierarchical timing analysis
Sort
View
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
16 years 6 months ago
Random knapsack in expected polynomial time
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
René Beier, Berthold Vöcking
ICMCS
2006
IEEE
142views Multimedia» more  ICMCS 2006»
16 years 13 days ago
FEMA: A Fast Expectation Maximization Algorithm based on Grid and PCA
EM algorithm is an important unsupervised clustering algorithm, but the algorithm has several limitations. In this paper, we propose a fast EM algorithm (FEMA) to address the limi...
Zhiwen Yu, Hau-San Wong
WADS
2001
Springer
182views Algorithms» more  WADS 2001»
15 years 10 months ago
On the Complexity of Scheduling Conditional Real-Time Code
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
Samarjit Chakraborty, Thomas Erlebach, Lothar Thie...
COMSIS
2007
167views more  COMSIS 2007»
15 years 6 months ago
Developing a New Color Model for Image Analysis and Processing
The theoretical outcomes and experimental results of new color model implemented in algorithms and software of image processing are presented in the paper. This model, as it will b...
Rashad J. Rasras, Ibrahiem M. M. El Emary, Dimitri...
MMNS
2007
208views Multimedia» more  MMNS 2007»
15 years 7 months ago
Hybrid Overlay Networks Management for Real-Time Multimedia Streaming over P2P Networks
Recent growth of the multimedia content delivery over the Internet and the popularity of the peer-to-peer (P2P) architecture have opened new horizons for emerging novel services ov...
Mubashar Mushtaq, Toufik Ahmed