903 search results - page 12 / 181 » Non-well-founded trees in categories |
109
click to vote
PPOPP
2012
ACM
13 years 7 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
DAGSTUHL
2006
15 years 1 months ago
2006
This paper presents novel language and analysis techniques that significantly speed up software model checking of data structure properties. Consider checking a red-black tree imp...
DAC
2005
ACM
15 years 1 months ago
2005
ACM
Although a lot of research efforts have been made in the minimization of the total power consumption caused by the clock tree, no attention has been paid to the minimization of th...
149
click to vote
RIVF
2008
15 years 1 months ago
2008
The classification image into one of several categories is a problem arisen naturally under a wide range of circumstances. In this paper, we present a novel unsupervised model for ...
MOBIDE
2010
ACM
14 years 12 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...