Sciweavers

356 search results - page 37 / 72
» Approximation schemes for the Min-Max Starting Time Problem
Sort
View
CORR
2008
Springer
88views Education» more  CORR 2008»
13 years 7 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
CDC
2010
IEEE
141views Control Systems» more  CDC 2010»
13 years 2 months ago
Achieving higher frequencies in large-scale nonlinear model predictive control
We present new insights into how to achieve higher frequencies in large-scale nonlinear predictive control using truncated-like schemes. The basic idea is that, instead of solving ...
Victor M. Zavala, Mihai Anitescu
VLDB
2005
ACM
129views Database» more  VLDB 2005»
14 years 1 months ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis
ICML
2004
IEEE
14 years 8 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...
CODES
1998
IEEE
13 years 12 months ago
Software timing analysis using HW/SW cosimulation and instruction set simulator
Timing analysis for checking satisfaction of constraints is a crucial problem in real-time system design. In some current approaches, the delay of software modules is precalculate...
Jie Liu, Marcello Lajolo, Alberto L. Sangiovanni-V...