Sciweavers

1220 search results - page 215 / 244
» Dependent classes
Sort
View
ICALP
2009
Springer
14 years 8 months ago
Tight Bounds for the Cover Time of Multiple Random Walks
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
Robert Elsässer, Thomas Sauerwald
EDBT
2006
ACM
122views Database» more  EDBT 2006»
14 years 7 months ago
TQuEST: Threshold Query Execution for Large Sets of Time Series
Effective and efficient data mining in time series databases is essential in many application domains as for instance in financial analysis, medicine, meteorology, and environmenta...
Johannes Aßfalg, Hans-Peter Kriegel, Peer Kr...
ICSE
2004
IEEE-ACM
14 years 7 months ago
Validating the Unit Correctness of Spreadsheet Programs
Financial companies, engineering firms and even scientists create increasingly larger spreadsheets and spreadsheet programs. The creators of large spreadsheets make errors and mus...
Tudor Antoniu, Paul A. Steckler, Shriram Krishnamu...
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
14 years 5 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
EUROSYS
2006
ACM
14 years 4 months ago
Solving the starting problem: device drivers as self-describing artifacts
Run-time conflicts can affect even the most rigorously tested software systems. A reliance on execution-based testing makes it prohibitively costly to test every possible interac...
Michael F. Spear, Tom Roeder, Orion Hodson, Galen ...