Sciweavers

2434 search results - page 369 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
CP
2003
Springer
15 years 8 months ago
Open Constraint Optimization
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
Boi Faltings, Santiago Macho-Gonzalez
CVPR
2007
IEEE
16 years 5 months ago
Detector Ensemble
Component-based detection methods have demonstrated their promise by integrating a set of part-detectors to deal with large appearance variations of the target. However, an essent...
Shengyang Dai, Ming Yang, Ying Wu, Aggelos K. Kats...
DAC
2006
ACM
16 years 4 months ago
Statistical timing analysis with correlated non-gaussian parameters using independent component analysis
We propose a scalable and efficient parameterized block-based statistical static timing analysis algorithm incorporating both Gaussian and non-Gaussian parameter distributions, ca...
Jaskirat Singh, Sachin S. Sapatnekar
126
Voted
ALT
2006
Springer
16 years 12 days ago
How Many Query Superpositions Are Needed to Learn?
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
Jorge Castro
119
Voted
CPM
2009
Springer
127views Combinatorics» more  CPM 2009»
15 years 10 months ago
Deconstructing Intractability: A Case Study for Interval Constrained Coloring
The NP-hard Interval Constrained Coloring problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer interv...
Christian Komusiewicz, Rolf Niedermeier, Johannes ...