Sciweavers

3991 search results - page 213 / 799
» Bounding homogeneous models
Sort
View
FOCS
2002
IEEE
14 years 1 months ago
Learning a Hidden Matching
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
Noga Alon, Richard Beigel, Simon Kasif, Steven Rud...
WCET
2008
13 years 9 months ago
Computing time as a program variable: a way around infeasible paths
Conditional branches connect the values of program variables with the execution paths and thus with the execution times, including the worstcase execution time (WCET). Flow analys...
Niklas Holsti
AAAI
1994
13 years 9 months ago
Applying VC-Dimension Analysis To 3D Object Recognition from Perspective Projections
We analyze the amount of information needed to carry out model-based recognition tasks, in the context of a probabilistic data collection model, and independently of the recogniti...
Michael Lindenbaum, Shai Ben-David
CDC
2010
IEEE
133views Control Systems» more  CDC 2010»
13 years 3 months ago
Robustness of funnel control in the gap metric
For m-input, m-output, finite-dimensional, linear systems satisfying the classical assumptions of adaptive control (i.e., (i) minimum phase, (ii) relative degree one and (iii) pos...
Achim Ilchmann, Markus Mueller
CORR
2011
Springer
163views Education» more  CORR 2011»
13 years 3 months ago
Statistical Analysis of Link Scheduling on Long Paths
We study how the choice of packet scheduling algorithms influences end-to-end performance on long network paths. Taking a network calculus approach, we consider both deterministi...
Yashar Ghiassi-Farrokhfal, Jörg Liebeherr, Al...