Sciweavers

4850 search results - page 646 / 970
» Approximate Data Structures with Applications
Sort
View
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
15 years 12 months ago
Key semantics extraction by dependency tree mining
We propose a new text mining system which extracts characteristic contents from given documents. We define Key semantics as characteristic sub-structures of syntactic dependencie...
Satoshi Morinaga, Hiroki Arimura, Takahiro Ikeda, ...
223
Voted
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
15 years 11 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
BMCBI
2008
122views more  BMCBI 2008»
15 years 6 months ago
Effects of dependence in high-dimensional multiple testing problems
Background: We consider effects of dependence among variables of high-dimensional data in multiple hypothesis testing problems, in particular the False Discovery Rate (FDR) contro...
Kyung In Kim, Mark A. van de Wiel
IS
2010
15 years 4 months ago
Tree pattern mining with tree automata constraints
Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chem...
Sandra de Amo, Nyara A. Silva, Ronaldo P. Silva, F...
IPPS
2008
IEEE
16 years 24 days ago
Lattice Boltzmann simulation optimization on leading multicore platforms
We present an auto-tuning approach to optimize application performance on emerging multicore architectures. The methodology extends the idea of searchbased performance optimizatio...
Samuel Williams, Jonathan Carter, Leonid Oliker, J...