Sciweavers

206 search results - page 23 / 42
» A nonblocking set optimized for querying the minimum value
Sort
View
FLAIRS
2008
15 years 2 months ago
A Backward Adjusting Strategy and Optimization of the C4.5 Parameters to Improve C4.5's Performance
In machine learning, decision trees are employed extensively in solving classification problems. In order to design a decision tree classifier two main phases are employed. The fi...
Jason R. Beck, Maria Garcia, Mingyu Zhong, Michael...
CORR
2011
Springer
234views Education» more  CORR 2011»
14 years 6 months ago
Mutual Information, Relative Entropy, and Estimation in the Poisson Channel
Let X be a non-negative random variable and let the conditional distribution of a random variable Y , given X, be Poisson(γ · X), for a parameter γ ≥ 0. We identify a natural...
Rami Atar, Tsachy Weissman
ICDE
2000
IEEE
158views Database» more  ICDE 2000»
16 years 1 months ago
The DC-Tree: A Fully Dynamic Index Structure for Data Warehouses
: Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and appl...
Hans-Peter Kriegel, Jörn Kohlhammer, Martin E...
SODA
2010
ACM
371views Algorithms» more  SODA 2010»
15 years 9 months ago
Online Learning with Queries
The online learning problem requires a player to iteratively choose an action in an unknown and changing environment. In the standard setting of this problem, the player has to ch...
Chao-Kai Chiang, Chi-Jen Lu
PODS
2010
ACM
207views Database» more  PODS 2010»
15 years 4 months ago
Understanding cardinality estimation using entropy maximization
Cardinality estimation is the problem of estimating the number of tuples returned by a query; it is a fundamentally important task in data management, used in query optimization, ...
Christopher Ré, Dan Suciu