Sciweavers

1284 search results - page 30 / 257
» Data Structures for Mergeable Trees
Sort
View
COR
2004
115views more  COR 2004»
13 years 6 months ago
Evaluation of decision trees: a multi-criteria approach
Data mining (DM) techniques are being increasingly used in many modern organizations to retrieve valuable knowledge structures from organizational databases, including data wareho...
Kweku-Muata Osei-Bryson
ACL
2010
13 years 4 months ago
Edit Tree Distance Alignments for Semantic Role Labelling
Tree SRL system is a Semantic Role Labelling supervised system based on a tree-distance algorithm and a simple k-NN implementation. The novelty of the system lies in comparing the...
Hector-Hugo Franco-Penya
CACM
1998
110views more  CACM 1998»
13 years 6 months ago
Viewing WISs as Database Applications
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
Gustavo O. Arocena, Alberto O. Mendelzon
TIC
2000
Springer
174views System Software» more  TIC 2000»
13 years 10 months ago
Alias Types for Recursive Data Structures
Linear type systems permit programmers to deallocate or explicitly recycle memory, but they are severly restricted by the fact that they admit no aliasing. This paper describes a ...
David Walker, J. Gregory Morrisett
CORR
2008
Springer
74views Education» more  CORR 2008»
13 years 6 months ago
Biased Range Trees
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R2 and a query distribution D for 2-sided orthogonal range counting queries. The...
Vida Dujmovic, John Howat, Pat Morin