Sciweavers

9842 search results - page 81 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
ALGORITHMICA
2002
121views more  ALGORITHMICA 2002»
13 years 7 months ago
Sharp Quantum versus Classical Query Complexity Separations
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
J. Niel de Beaudrap, Richard Cleve, John Watrous
INTERSPEECH
2010
13 years 2 months ago
Performance estimation of noisy speech recognition considering recognition task complexity
To ensure a satisfactory QoE (Quality of Experience) and facilitate system design in speech recognition services, it is essential to establish a method that can be used to efficie...
Takeshi Yamada, Tomohiro Nakajima, Nobuhiko Kitawa...
ANSS
2001
IEEE
13 years 11 months ago
Models of Complex Physical Systems Using Cell-DEVS
We present the definition of diverse models of physical systems using the Cell-DEVS paradigm. Cell-DEVS is an extension of the DEVS formalism that allows the definition of cellula...
Javier Ameghino, Alejandro Troccoli, Gabriel A. Wa...
VR
2000
IEEE
114views Virtual Reality» more  VR 2000»
13 years 11 months ago
Virtual Fekete Point Configurations: A Case Study in Perturbing Complex Systems
Virtual environments have shown great promise as a research tool in science and engineering. In this paper we study a classical problem in mathematics: that of approximating globa...
Robert van Liere, Jurriaan D. Mulder, Jason Frank,...
AAAI
2007
13 years 10 months ago
Computational Complexity of Weighted Threshold Games
Weighted threshold games are coalitional games in which each player has a weight (intuitively corresponding to its voting power), and a coalition is successful if the sum of its w...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...