Sciweavers

1813 search results - page 325 / 363
» Calculi of Approximation Spaces
Sort
View
133
Voted
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
15 years 7 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
147
Voted
ASPDAC
2001
ACM
102views Hardware» more  ASPDAC 2001»
15 years 7 months ago
New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...
Andrew B. Kahng, Shailesh Vaya, Alexander Zelikovs...
135
Voted
AIPS
2010
15 years 6 months ago
When Policies Can Be Trusted: Analyzing a Criteria to Identify Optimal Policies in MDPs with Unknown Model Parameters
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
Emma Brunskill
143
Voted
CRV
2006
IEEE
176views Robotics» more  CRV 2006»
15 years 5 months ago
Stereo Retinex
The retinex algorithm for lightness and color constancy is extended to include 3-dimensional spatial information reconstructed from a stereo image. A key aspect of traditional ret...
Weihua Xiong, Brian V. Funt
IWMM
2010
Springer
140views Hardware» more  IWMM 2010»
15 years 5 months ago
Parametric inference of memory requirements for garbage collected languages
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...