Sciweavers

3341 search results - page 410 / 669
» On Bounded Queries and Approximation
Sort
View
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
15 years 11 months ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito
COCOON
2004
Springer
15 years 10 months ago
k-Center Problems with Minimum Coverage
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...
Andrew Lim, Brian Rodrigues, Fan Wang, Zhou Xu
COLT
2006
Springer
15 years 10 months ago
Unifying Divergence Minimization and Statistical Inference Via Convex Duality
Abstract. In this paper we unify divergence minimization and statistical inference by means of convex duality. In the process of doing so, we prove that the dual of approximate max...
Yasemin Altun, Alexander J. Smola
HYBRID
2000
Springer
15 years 10 months ago
Ellipsoidal Techniques for Reachability Analysis
For the reach tube of a linear time-varying system with ellipsoidal bounds on the control variable consider the following approximation problem. Find a tight ellipsoid-valued tube...
Alexander B. Kurzhanski, Pravin Varaiya
ASPDAC
2008
ACM
154views Hardware» more  ASPDAC 2008»
15 years 8 months ago
Automated techniques for energy efficient scheduling on homogeneous and heterogeneous chip multi-processor architectures
Abstract-- We address performance maximization of independent task sets under energy constraint on chip multi-processor (CMP) architectures that support multiple voltage/frequency ...
Sushu Zhang, Karam S. Chatha