447 search results - page 36 / 90 » Decision trees with minimal costs |
170
click to vote
UAI
2004
15 years 8 months ago
2004
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Bo...
204
click to vote
ICCAD
1995
IEEE
15 years 10 months ago
1995
IEEE
In this paper we investigate activity-driven clock trees to reduce the dynamic power consumption of synchronous digital CMOS circuits. Sections of an activity-driven clock tree ca...
168
click to vote
MOBIDE
2010
ACM
15 years 7 months ago
2010
ACM
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optim...
165
click to vote
SAC
2002
ACM
15 years 6 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
155
Voted
ISPDC
2006
IEEE
16 years 22 days ago
2006
IEEE
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...