Sciweavers

1132 search results - page 108 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
DAC
2004
ACM
16 years 7 months ago
Fast statistical timing analysis handling arbitrary delay correlations
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...
Michael Orshansky, Arnab Bandyopadhyay
EUROGP
2009
Springer
149views Optimization» more  EUROGP 2009»
16 years 1 months ago
Adaptation, Performance and Vapnik-Chervonenkis Dimension of Straight Line Programs
Abstract. We discuss here empirical comparation between model selection methods based on Linear Genetic Programming. Two statistical methods are compared: model selection based on ...
José Luis Montaña, César Luis...
CGF
2000
81views more  CGF 2000»
15 years 6 months ago
Generating Consistent Motion Transition via Decoupled Framespace Interpolation
espace interpolation algorithm abstracts motion sequences as 1D signals, and interpolates between them to create higher dimension signals, with weights drawn from a user specified...
Golam Ashraf, Kok Cheong Wong
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
15 years 11 months ago
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
Andris Ambainis, Ke Yang
FOCS
1995
IEEE
15 years 10 months ago
Tracking the Best Disjunction
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
Peter Auer, Manfred K. Warmuth