Sciweavers

6142 search results - page 862 / 1229
» The Complexity of Partition Functions
Sort
View
TAMC
2007
Springer
16 years 27 days ago
Kernelizations for Parameterized Counting Problems
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
Marc Thurley
ECBS
2006
IEEE
158views Hardware» more  ECBS 2006»
16 years 26 days ago
Automated Translation of C/C++ Models into a Synchronous Formalism
For complex systems that are reusing intellectual property components, functional and compositional design correctness are an important part of the design process. Common system l...
Hamoudi Kalla, Jean-Pierre Talpin, David Berner, L...
MICRO
2006
IEEE
127views Hardware» more  MICRO 2006»
16 years 24 days ago
A Predictive Performance Model for Superscalar Processors
Designing and optimizing high performance microprocessors is an increasingly difficult task due to the size and complexity of the processor design space, high cost of detailed si...
P. J. Joseph, Kapil Vaswani, Matthew J. Thazhuthav...
VISUALIZATION
2005
IEEE
16 years 11 days ago
Illustration and Photography Inspired Visualization of Flows and Volumes
Understanding and analyzing complex volumetrically varying data is a difficult problem. Many computational visualization techniques have had only limited success in succinctly po...
Nikolai A. Svakhine, Yun Jang, David S. Ebert, Kel...
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
16 years 10 days ago
Towards truthful mechanisms for binary demand games: a general framework
The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They...
Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang