Sciweavers

1489 search results - page 4 / 298
» Optimizing Feature Sets for Structured Data
Sort
View
PVLDB
2008
182views more  PVLDB 2008»
13 years 7 months ago
SCOPE: easy and efficient parallel processing of massive data sets
Companies providing cloud-scale services have an increasing need to store and analyze massive data sets such as search logs and click streams. For cost and performance reasons, pr...
Ronnie Chaiken, Bob Jenkins, Per-Åke Larson,...
ACL
2004
13 years 9 months ago
Optimizing Typed Feature Structure Grammar Parsing through Non-Statistical Indexing
This paper introduces an indexing method based on static analysis of grammar rules and type signatures for typed feature structure grammars (TFSGs). The static analysis tries to p...
Cosmin Munteanu, Gerald Penn
AMR
2007
Springer
143views Multimedia» more  AMR 2007»
14 years 1 months ago
User Modelling for Interactive User-Adaptive Collection Structuring
Abstract. Automatic structuring is one means to ease access to document collections, be it for organization or for exploration. Of even greater help would be a presentation that ad...
Andreas Nürnberger, Sebastian Stober
WEA
2010
Springer
545views Algorithms» more  WEA 2010»
14 years 2 months ago
Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure
Abstract. The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe. Algorithms that operate on this data structu...
Md. Mostofa Ali Patwary, Jean R. S. Blair, Fredrik...
PKDD
2009
Springer
113views Data Mining» more  PKDD 2009»
14 years 2 months ago
Feature Selection for Density Level-Sets
A frequent problem in density level-set estimation is the choice of the right features that give rise to compact and concise representations of the observed data. We present an e...
Marius Kloft, Shinichi Nakajima, Ulf Brefeld