Sciweavers

55 search results - page 5 / 11
» Compact dictionaries for variable-length keys and data with ...
Sort
View
JCB
2007
118views more  JCB 2007»
14 years 9 months ago
Discovering Topological Motifs Using a Compact Notation
Discovering topological motifs or common topologies in one or more graphs is an important as well as an interesting problem. It had been classically viewed as the subgraph isomorp...
Laxmi Parida
ADCM
2005
163views more  ADCM 2005»
14 years 9 months ago
Matrix-valued radial basis functions: stability estimates and applications
Radial basis functions (RBFs) have found important applications in areas such as signal processing, medical imaging, and neural networks since the early 1980's. Several appli...
Svenja Lowitzsch
ICALP
2005
Springer
15 years 3 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
CPM
2006
Springer
175views Combinatorics» more  CPM 2006»
15 years 1 months ago
On-Line Linear-Time Construction of Word Suffix Trees
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...
Shunsuke Inenaga, Masayuki Takeda
DGO
2000
91views Education» more  DGO 2000»
14 years 11 months ago
Simplifying data access: the energy data collection (EDC) project
The massive amount of statistical and text data available from government agencies has created a set of daunting challenges to both research and analysis communities. These proble...
José Luis Ambite, Yigal Arens, Luis Gravano...