Sciweavers

1661 search results - page 149 / 333
» Decision Tree Fields
Sort
View
DATESO
2009
158views Database» more  DATESO 2009»
15 years 4 months ago
Benchmarking Coding Algorithms for the R-tree Compression
Multi-dimensional data structures have been widely applied in many data management fields. Spatial data indexing is their natural application, however there are many applications i...
Jirí Walder, Michal Krátký, R...
IFIP
2010
Springer
15 years 3 months ago
Supporting DSS Acceptability through a User-Centered Design Methodology: Experiences in Emergency Management
This paper presents a user-centered design methodology for Decision Support Systems (DSSs), which is specifically built to face the socio-technical gap that often impedes DSS accep...
Pietro Baroni, Daniela Fogli, Massimiliano Giacomi...
JACM
2006
99views more  JACM 2006»
15 years 6 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
16 years 6 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...
ICCAD
1999
IEEE
181views Hardware» more  ICCAD 1999»
15 years 10 months ago
A new heuristic for rectilinear Steiner trees
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganle...