285 search results - page 7 / 57 » New Ways to Construct Binary Search Trees |
AAAI
2004
13 years 11 months ago
2004
A binary constraint network is tree convex if we can construct a tree for the domain of the variables so that for any constraint, no matter what value one variable takes, all the ...
CAD
2008
Springer
13 years 10 months ago
2008
Springer
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
ICIP
2009
IEEE
14 years 9 months ago
2009
IEEE
We propose a binary Markov Random Field (MRF) model
that assigns high probability to regions in the image domain
consisting of an unknown number of circles of a given radius.
We...
ASIACRYPT
2003
Springer
14 years 3 months ago
2003
Springer
We present two new parallel algorithms for extending the domain of a UOWHF. The first algorithm is complete binary tree based construction and has less key length expansion than S...
CC
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...