Sciweavers

581 search results - page 24 / 117
» An Automata Model for Trees with Ordered Data Values
Sort
View
EDBT
2004
ACM
187views Database» more  EDBT 2004»
16 years 6 months ago
Hierarchical In-Network Data Aggregation with Quality Guarantees
Earlier work has demonstrated the effectiveness of in-network data aggregation in order to minimize the amount of messages exchanged during continuous queries in large sensor netwo...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
FLAIRS
2008
15 years 8 months ago
A Backward Adjusting Strategy and Optimization of the C4.5 Parameters to Improve C4.5's Performance
In machine learning, decision trees are employed extensively in solving classification problems. In order to design a decision tree classifier two main phases are employed. The fi...
Jason R. Beck, Maria Garcia, Mingyu Zhong, Michael...
KDD
2007
ACM
148views Data Mining» more  KDD 2007»
16 years 6 months ago
Scalable look-ahead linear regression trees
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
David S. Vogel, Ognian Asparouhov, Tobias Scheffer
CGF
2002
116views more  CGF 2002»
15 years 5 months ago
Deferred, Self-Organizing BSP Trees
BSP trees and KD trees are fundamental data structures for collision detection in walkthrough environments. A basic issue in the construction of these hierarchical data structures...
Sigal Ar, Gil Montag, Ayellet Tal
DEXA
2004
Springer
126views Database» more  DEXA 2004»
15 years 11 months ago
Detecting Content Changes on Ordered XML Documents Using Relational Databases
Abstract. Previous works in change detection on XML focused on detecting changes to text file using ordered and unordered tree model. These approaches are not suitable for detecti...
Erwin Leonardi, Sourav S. Bhowmick, T. S. Dharma, ...