Sciweavers

Share
20 search results - page 2 / 4
» Efficient Reorganization of Binary Search Trees
Sort
View
SIAMCOMP
2002
142views more  SIAMCOMP 2002»
9 years 5 months ago
On Binary Searching with Nonuniform Costs
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur...
DAC
2003
ACM
10 years 6 months ago
Automated synthesis of efficient binary decoders for retargetable software toolkits
A binary decoder is a common component of software development tools such as instruction set simulators, disassemblers and debuggers. The efficiency of the decoder can have a sign...
Wei Qin, Sharad Malik
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
9 years 9 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
EWSN
2008
Springer
10 years 5 months ago
Lifetime Maximization in Wireless Sensor Networks by Distributed Binary Search
We consider the problem of determining the transmission power assignment that maximizes the lifetime of a data-gathering wireless sensor network with stationary nodes and static tr...
André Schumacher, Harri Haanpää, ...
IJCV
2008
157views more  IJCV 2008»
9 years 5 months ago
Pairwise Matching of 3D Fragments Using Cluster Trees
Abstract We propose a novel and efficient surface matching approach for reassembling broken solids as well as for matching assembly components using cluster trees of oriented point...
Simon Winkelbach, Friedrich M. Wahl
books