Sciweavers

7106 search results - page 98 / 1422
» Restricted Complexity, General Complexity
Sort
View
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 8 months ago
Strong direct product theorems for quantum communication and query complexity
A strong direct product theorem (SDPT) states that solving n instances of a problem requires ˝.n/ times the resources for a single instance, even to achieve success probability 2 ...
Alexander A. Sherstov
JUCS
2010
129views more  JUCS 2010»
13 years 8 months ago
Orthogonal Concatenation: Language Equations and State Complexity
: A language L is the orthogonal concatenation of languages L1 and L2 if every word of L can be written in a unique way as a concatenation of a word in L1 and a word in L2. The not...
Mark Daley, Michael Domaratzki, Kai Salomaa
INTERSPEECH
2010
13 years 4 months ago
Chirp complex cepstrum-based decomposition for asynchronous glottal analysis
It was recently shown that complex cepstrum can be effectively used for glottal flow estimation by separating the causal and anticausal components of speech. In order to guarantee...
Thomas Drugman, Thierry Dutoit
CSCW
2012
ACM
12 years 5 months ago
CrowdWeaver: visually managing complex crowd work
Though toolkits exist to create complex crowdsourced workflows, there is limited support for management of those workflows. Managing crowd workers and tasks requires significant i...
Aniket Kittur, Susheel Khamkar, Paul André,...
AAAI
2007
14 years 13 days ago
DL-Lite in the Light of First-Order Logic
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large a...
Alessandro Artale, Diego Calvanese, Roman Kontchak...