Sciweavers

3341 search results - page 469 / 669
» On Bounded Queries and Approximation
Sort
View
PAKDD
2004
ACM
127views Data Mining» more  PAKDD 2004»
15 years 12 months ago
Separating Structure from Interestingness
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
Taneli Mielikäinen
LATIN
2010
Springer
15 years 11 months ago
The Power of Fair Pricing Mechanisms
We explore the revenue capabilities of truthful, monotone (“fair”) allocation and pricing functions for resource-constrained auction mechanisms within a general framework that ...
Christine Chung, Katrina Ligett, Kirk Pruhs, Aaron...
ICLP
1997
Springer
15 years 10 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
NN
1997
Springer
174views Neural Networks» more  NN 1997»
15 years 10 months ago
Learning Dynamic Bayesian Networks
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
Zoubin Ghahramani
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
15 years 10 months ago
Efficient Reorganization of Binary Search Trees
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
Micha Hofri, Hadas Shachnai