Sciweavers

14382 search results - page 428 / 2877
» Time in Connectionist Models
Sort
View
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
16 years 7 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
SDM
2009
SIAM
127views Data Mining» more  SDM 2009»
16 years 4 months ago
Event Discovery in Time Series.
The discovery of events in time series can have important implications, such as identifying microlensing events in astronomical surveys, or changes in a patient’s electrocardiog...
Carla E. Brodley, Dan Preston, Pavlos Protopapas
ICCAD
2007
IEEE
105views Hardware» more  ICCAD 2007»
16 years 1 months ago
Victim alignment in crosstalk aware timing analysis
Modeling the effect of coupling noise on circuit delay is a key issue in static timing analysis (STA) and involves the “victimaggressor alignment” problem. As delay-noise depe...
Ravikishore Gandikota, Kaviraj Chopra, David Blaau...
ECRTS
2005
IEEE
16 years 14 days ago
Fast and Tight Response-Times for Tasks with Offsets
In previous work, we presented a tight approximate response-time analysis for tasks with offsets. While providing a tight bound on response times, the tight analysis exhibits simi...
Jukka Mäki-Turja, Mikael Nolin
IWPSE
2005
IEEE
16 years 12 days ago
Languages evolve too! Changing the Software Time Scale
Humans will have to live with software for a long time. As demonstrated by the Y2K problem, computer professionals used a wrong time scale when thinking about software. Large soft...
Jean-Marie Favre