Sciweavers

3946 search results - page 205 / 790
» The computational complexity of choice sets
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Fast algorithms for Iterative Adaptive Approach spectral estimation techniques
This paper presents computationally efficient implementations for Iterative Adaptive Approach (IAA) spectral estimation techniques for uniformly sampled data sets. By exploiting ...
George-Othon Glentis, Andreas Jakobsson
RELMICS
1998
Springer
15 years 11 months ago
Coping with semilattices of relations in logics with relative accessibility relations
We present a class of polymodal logics for which the set of terms indexing the modal connectives can be hierarchized in two levels: the set of Boolean terms and the set of terms b...
Stéphane Demri
ACL
2012
13 years 9 months ago
You Had Me at Hello: How Phrasing Affects Memorability
Understanding the ways in which information achieves widespread public awareness is a research question of significant interest. We consider whether, and how, the way in which th...
Cristian Danescu-Niculescu-Mizil, Justin Cheng, Jo...
ADBIS
2006
Springer
166views Database» more  ADBIS 2006»
16 years 19 days ago
Clustering-Based Materialized View Selection in Data Warehouses
materialized view selection is a non-trivial task. Hence, its complexity must be reduced. A judicious choice of views must be costdriven and influenced by the workload experienced...
Kamel Aouiche, Pierre-Emmanuel Jouve, Jér&o...
ISER
2000
Springer
112views Robotics» more  ISER 2000»
15 years 10 months ago
Simulation and Experimental Evaluation of Complete Sensor-Based Coverage in Rectilinear Environments
: Although sensor-based coverage is a skill which is applicable to a variety of robot tasks, its implementation has so far been limited, mostly by the physical limitations of tradi...
Zack J. Butler, Alfred A. Rizzi, Ralph L. Hollis