Sciweavers

1284 search results - page 100 / 257
» Data Structures for Mergeable Trees
Sort
View
NBIS
2007
Springer
14 years 1 months ago
Implementing Range Queries with a Decentralized Balanced Tree over Distributed Hash Tables
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
Nuno Lopes, Carlos Baquero
ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
13 years 11 months ago
Softening Splits in Decision Trees Using Simulated Annealing
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
Jakub Dvorák, Petr Savický
EDBT
2004
ACM
313views Database» more  EDBT 2004»
14 years 7 months ago
XQzip: Querying Compressed XML Using Structural Indexing
XML makes data flexible in representation and easily portable on the Web but it also substantially inflates data size as a consequence of using tags to describe data. Although many...
James Cheng, Wilfred Ng
ICPR
2004
IEEE
14 years 8 months ago
Building and Registering Parameterized 3D Models of Vessel Trees for Visualization during Intervention
In this paper we address the problem of multimodal registration of coronary vessels by developing a 3D parametrical model of vessel trees from computer tomography data and registe...
Georg Langs, Petia Radeva, David Rotger, Francesc ...
SDM
2010
SIAM
192views Data Mining» more  SDM 2010»
13 years 9 months ago
Fast and Accurate Gene Prediction by Decision Tree Classification
Gene prediction is one of the most challenging tasks in genome analysis, for which many tools have been developed and are still evolving. In this paper, we present a novel gene pr...
Rong She, Jeffrey Shih-Chieh Chu, Ke Wang, Nanshen...