Sciweavers

543 search results - page 40 / 109
» New Upper Bounds for MaxSat
Sort
View
LCTRTS
2010
Springer
14 years 11 months ago
Resilience analysis: tightening the CRPD bound for set-associative caches
In preemptive real-time systems, scheduling analyses need—in addition to the worst-case execution time—the context-switch cost. In case of preemption, the preempted and the pr...
Sebastian Altmeyer, Claire Maiza, Jan Reineke
CNSR
2007
IEEE
158views Communications» more  CNSR 2007»
14 years 11 months ago
Bounding the Information Collection Performance of Wireless Sensor Network Routing
Wireless sensor networks have mainly been designed for information-collecting purposes, such as habitat monitoring, product process tracing, battlefield surveillance, etc. In orde...
Qinghua Wang, Tingting Zhang, Stefan Pettersson
ICML
2009
IEEE
15 years 10 months ago
Robust bounds for classification via selective sampling
We introduce a new algorithm for binary classification in the selective sampling protocol. Our algorithm uses Regularized Least Squares (RLS) as base classifier, and for this reas...
Nicolò Cesa-Bianchi, Claudio Gentile, Franc...
APPROX
2010
Springer
148views Algorithms» more  APPROX 2010»
14 years 11 months ago
Learning and Lower Bounds for AC0 with Threshold Gates
In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate at the output can be efficiently learned from uniform random examples. We answer this ques...
Parikshit Gopalan, Rocco A. Servedio
ICCV
2009
IEEE
14 years 7 months ago
A robust boosting tracker with minimum error bound in a co-training framework
The varying object appearance and unlabeled data from new frames are always the challenging problem in object tracking. Recently machine learning methods are widely applied to tra...
Rong Liu, Jian Cheng, Hanqing Lu