Sciweavers

1773 search results - page 27 / 355
» The Visibility-Voronoi Complex and Its Applications
Sort
View
ICALP
2007
Springer
15 years 8 months ago
Unbounded-Error One-Way Classical and Quantum Communication Complexity
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Sh...
ML
2002
ACM
128views Machine Learning» more  ML 2002»
15 years 1 months ago
A Simple Method for Generating Additive Clustering Models with Limited Complexity
Additive clustering was originally developed within cognitive psychology to enable the development of featural models of human mental representation. The representational flexibili...
Michael D. Lee
IWPC
2010
IEEE
15 years 10 days ago
A Simple and Effective Measure for Complex Low-Level Dependencies
The measure dep-degree is a simple indicator for structural problems and complex dependencies on code-level. We model low-level dependencies between program operations as use-def ...
Dirk Beyer, Ashgan Fararooy
JAPLL
2010
133views more  JAPLL 2010»
15 years 10 days ago
Complexity of modal logics with Presburger constraints
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...
Stéphane Demri, Denis Lugiez
SAMOS
2009
Springer
15 years 8 months ago
An Embrace-and-Extend Approach to Managing the Complexity of Future Heterogeneous Systems
Abstract. In this paper, we present a particularly lightweight, integrative approach to programming and executing applications targeting heterogeneous, dynamically reconfigurable ...
Rainer Buchty, Mario Kicherer, David Kramer, Wolfg...