Sciweavers

117 search results - page 17 / 24
» Approximate Functional Dependencies for XML Data
Sort
View
KDD
2004
ACM
173views Data Mining» more  KDD 2004»
14 years 7 months ago
A microeconomic data mining problem: customer-oriented catalog segmentation
The microeconomic framework for data mining [7] assumes that an enterprise chooses a decision maximizing the overall utility over all customers where the contribution of a custome...
Martin Ester, Rong Ge, Wen Jin, Zengjian Hu
ECOOP
2006
Springer
13 years 11 months ago
Demeter Interfaces: Adaptive Programming Without Surprises
Adaptive Programming (AP) allows for the separate definition of data structures and traversals with attached computations, performed during the traversal, that operate on these dat...
Therapon Skotiniotis, Jeffrey Palm, Karl J. Lieber...
ML
2008
ACM
152views Machine Learning» more  ML 2008»
13 years 7 months ago
Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...
András Antos, Csaba Szepesvári, R&ea...
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 4 months ago
On the Queueing Behavior of Random Codes over a Gilbert-Elliot Erasure Channel
This paper considers the queueing performance of a system that transmits coded data over a time-varying erasure channel. In our model, the queue length and channel state together f...
Parimal Parag, Jean-François Chamberland, H...
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 4 months ago
Fast Pseudo-Random Fingerprints
Abstract. We propose a method to exponentially speed up computation of various fingerprints, such as the ones used to compute similarity and rarity in massive data sets. Rather the...
Yoram Bachrach, Ely Porat