Sciweavers

959 search results - page 75 / 192
» New Techniques for Algorithm Portfolio Design
Sort
View
DAC
2005
ACM
16 years 25 days ago
Diffusion-based placement migration
Placement migration is the movement of cells within an existing placement to address a variety of post-placement design closure issues, such as timing, routing congestion, signal ...
Haoxing Ren, David Zhigang Pan, Charles J. Alpert,...
ATAL
2007
Springer
15 years 6 months ago
SSDPOP: improving the privacy of DCOP with secret sharing
Multi-agent systems designed to work collaboratively with groups of people typically require private information that people will entrust to them only if they have assurance that ...
Rachel Greenstadt, Barbara J. Grosz, Michael D. Sm...
DAC
2011
ACM
13 years 11 months ago
Efficient incremental analysis of on-chip power grid via sparse approximation
In this paper, a new sparse approximation technique is proposed for incremental power grid analysis. Our proposed method is motivated by the observation that when a power grid net...
Pei Sun, Xin Li, Ming Yuan Ting
FOCS
2009
IEEE
15 years 6 months ago
A Complete Characterization of Statistical Query Learning with Applications to Evolvability
Statistical query (SQ) learning model of Kearns is a natural restriction of the PAC learning model in which a learning algorithm is allowed to obtain estimates of statistical prop...
Vitaly Feldman
ECCV
2004
Springer
15 years 5 months ago
Cone-Beam Image Reconstruction by Moving Frames
In this paper, we present a new algorithmic paradigm for cone-beam image reconstruction. The new class of algorithms, referred to as cone-beam reconstruction by moving frames, enab...
Xiaochun Yang 0002, Berthold K. P. Horn