106 search results - page 11 / 22 » Average Case Analysis for Tree Labelling Schemes |
IS
2010
14 years 8 months ago
2010
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
105
Voted
SODA
2010
ACM
15 years 6 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
108
click to vote
PODS
2007
ACM
15 years 9 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
ICML
1999
IEEE
15 years 10 months ago
1999
IEEE
Lbr is a lazy semi-naive Bayesian classi er learning technique, designed to alleviate the attribute interdependence problem of naive Bayesian classi cation. To classify a test exa...
INFOCOM
1993
IEEE
15 years 1 months ago
1993
IEEE
Worst-casebounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of Generalized Processor Sharing (GPS) 10] servers. The inhe...