Sciweavers

3229 search results - page 439 / 646
» The Theory of Timed Automata
Sort
View
NIPS
2007
15 years 8 months ago
Stability Bounds for Non-i.i.d. Processes
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
Mehryar Mohri, Afshin Rostamizadeh
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
15 years 8 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska
IADIS
2004
15 years 8 months ago
Telecollaboration - a case study for performance analysis of voip systems
The evolving nature of complex traffic issues of IP (Internet Protocol)-based Telecollaboration (TC) business system technology requires an intuitive understanding for the partici...
Venkatesh Mahadevan, Zenon Chaczko
SODA
2004
ACM
116views Algorithms» more  SODA 2004»
15 years 8 months ago
Retroactive data structures
We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past. In this new paradigm, called ret...
Erik D. Demaine, John Iacono, Stefan Langerman
WSC
1997
15 years 8 months ago
Long-Lasting Transient Conditions in Simulations with Heavy-Tailed Workloads
Recent evidence suggests that some characteristics of computer and telecommunications systems may be well described using heavy tailed distributions — distributions whose tail d...
Mark Crovella, Lester Lipsky