Sciweavers

11488 search results - page 1938 / 2298
» Robust optimization - methodology and applications
Sort
View
VLSID
2002
IEEE
116views VLSI» more  VLSID 2002»
16 years 7 months ago
Efficient Macromodeling for On-Chip Interconnects
The improved T and improved n models are proposed for onchip interconnect macromodeling. Using global approximations, simple approximation frames are derived and applied to modeli...
Qinwei Xu, Pinaki Mazumder
CHI
2004
ACM
16 years 7 months ago
Multiblending: displaying overlapping windows simultaneously without the drawbacks of alpha blending
Alpha blending allows the simultaneous display of overlapping windows--such as palette windows in visual workspaces. Although alpha blending has been used in some applications, su...
Patrick Baudisch, Carl Gutwin
POPL
2004
ACM
16 years 7 months ago
Incremental execution of transformation specifications
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
Ganesh Sittampalam, Oege de Moor, Ken Friis Larsen
RECOMB
2005
Springer
16 years 7 months ago
Alignment of Optical Maps
We introduce a new scoring method for calculation of alignments of optical maps. Missing cuts, false cuts, and sizing errors present in optical maps are addressed by our alignment...
Anton Valouev, Lei Li, Yu-Chi Liu, David C. Schwar...
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
16 years 7 months ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek
« Prev « First page 1938 / 2298 Last » Next »