Sciweavers

3341 search results - page 249 / 669
» On Bounded Queries and Approximation
Sort
View
CDC
2008
IEEE
120views Control Systems» more  CDC 2008»
16 years 1 months ago
Approximate abstractions of discrete-time controlled stochastic hybrid systems
ate Abstractions of Discrete-Time Controlled Stochastic Hybrid Systems Alessandro D’Innocenzo, Alessandro Abate, and Maria D. Di Benedetto — This work proposes a procedure to c...
Alessandro D'Innocenzo, Alessandro Abate, Maria Do...
INFOCOM
2008
IEEE
16 years 1 months ago
Approximation Algorithms for Scheduling Real-Time Multicast Flows in Wireless LANs
—Abstract—In recent years, numerous large-scale Wireless LANs (WLAN) have been deployed all over the world. However, the shortage of non-interfering channels makes it a challen...
Yigal Bejerano, Dongwook Lee, Prasun Sinha, Lisa Z...
ICRA
2007
IEEE
155views Robotics» more  ICRA 2007»
16 years 29 days ago
Swept Volume approximation of polygon soups
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
Jesse C. Himmelstein, Etienne Ferre, Jean-Paul Lau...
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
16 years 3 hour ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
COCO
2010
Springer
144views Algorithms» more  COCO 2010»
15 years 10 months ago
A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold Functions
We give a “regularity lemma” for degree-d polynomial threshold functions (PTFs) over the Boolean cube {−1, 1}n . Roughly speaking, this result shows that every degree-d PTF ...
Ilias Diakonikolas, Rocco A. Servedio, Li-Yang Tan...