Sciweavers

2479 search results - page 471 / 496
» Quantum complexity theory
Sort
View
VLSID
1998
IEEE
116views VLSI» more  VLSID 1998»
14 years 1 months ago
Synthesis of Testable RTL Designs
With several commercial tools becoming available, the high-level synthesis of applicationspeci c integrated circuits is nding wide spread acceptance in VLSI industry today. Existi...
C. P. Ravikumar, Sumit Gupta, Akshay Jajoo
VLDB
1998
ACM
82views Database» more  VLDB 1998»
14 years 1 months ago
Resource Scheduling for Composite Multimedia Objects
Scheduling algorithms for composite multimedia presentations need to ensure that the user-defined synchronization constraints for the various presentation components are met. This...
Minos N. Garofalakis, Yannis E. Ioannidis, Banu &O...
HICSS
1994
IEEE
141views Biometrics» more  HICSS 1994»
14 years 1 months ago
Empirical CATeam Research in Meetings
Meeting research and especially research on Computer Supported Meetings of natural teams is not available in abundance. What is reported of meetings often uses a rather limited th...
Helmut Krcmar, Henrik Lewe, Gerhard Schwabe
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
14 years 1 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
COLT
1993
Springer
14 years 1 months ago
Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
Paul W. Goldberg, Mark Jerrum