Sciweavers

6274 search results - page 382 / 1255
» From query complexity to computational complexity
Sort
View
ACMACE
2008
ACM
15 years 8 months ago
BeatBender: subsumption architecture for autonomous rhythm generation
BeatBender is a computer music project that explores a new method for generating emergent rhythmic drum patterns using the subsumption architecture. Rather than explicitly coding ...
Aaron Levisohn, Philippe Pasquier
TOG
2012
255views Communications» more  TOG 2012»
13 years 9 months ago
A probabilistic model for component-based shape synthesis
We present an approach to synthesizing shapes from complex domains, by identifying new plausible combinations of components from existing shapes. Our primary contribution is a new...
Evangelos Kalogerakis, Siddhartha Chaudhuri, Daphn...
PVLDB
2010
104views more  PVLDB 2010»
15 years 5 months ago
MCDB-R: Risk Analysis in the Database
Enterprises often need to assess and manage the risk arising from uncertainty in their data. Such uncertainty is typically modeled as a probability distribution over the uncertain...
Peter J. Haas, Christopher M. Jermaine, Subi Arumu...
174
Voted
PKDD
2009
Springer
181views Data Mining» more  PKDD 2009»
16 years 1 months ago
Active Learning for Reward Estimation in Inverse Reinforcement Learning
Abstract. Inverse reinforcement learning addresses the general problem of recovering a reward function from samples of a policy provided by an expert/demonstrator. In this paper, w...
Manuel Lopes, Francisco S. Melo, Luis Montesano
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
16 years 8 months ago
Adaptive Segmentation for Scientific Databases
In this paper we explore database segmentation in the context of a column-store DBMS targeted at a scientific database. We present a novel hardware- and scheme-oblivious segmentati...
Milena Ivanova, Martin L. Kersten, Niels Nes