Sciweavers

5981 search results - page 156 / 1197
» time 2006
Sort
View
MST
2007
167views more  MST 2007»
15 years 3 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
JCNS
2010
81views more  JCNS 2010»
15 years 2 months ago
Sensory information in local field potentials and spikes from visual and auditory cortices: time scales and frequency bands
Studies analyzing sensory cortical processing or trying to decode brain activity often rely on a combination of different electrophysiological signals, such as local field potentia...
Andrei Belitski, Stefano Panzeri, Cesare Magri, Ni...
NETWORK
2007
93views more  NETWORK 2007»
15 years 3 months ago
Modeling VoIP Call Holding Times for Telecommunications
Voice over IP is one of the most popular applications in broadband access networks. It is anticipated that the characteristics of call holding times (CHTs) for VoIP calls will be ...
Whai-En Chen, Hui-Nien Hung, Yi-Bing Lin
RC
2007
148views more  RC 2007»
15 years 3 months ago
Computing Population Variance and Entropy under Interval Uncertainty: Linear-Time Algorithms
In statistical analysis of measurement results, it is often necessary to compute the range [V , V ] of the population variance V = 1 n · n i=1 (xi −E)2 (where E = 1 n · n i=1 ...
Gang Xiang, Martine Ceberio, Vladik Kreinovich
123
Voted
DAC
2006
ACM
16 years 4 months ago
A new LP based incremental timing driven placement for high performance designs
In this paper, we propose a new linear programming based timing driven placement framework for high performance designs. Our LP framework is mainly net-based, but it takes advanta...
Tao Luo, David Newmark, David Z. Pan