Sciweavers

128 search results - page 4 / 26
» Topological grammars for data approximation
Sort
View
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
14 years 7 months ago
Discovering frequent topological structures from graph datasets
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
Ruoming Jin, Chao Wang, Dmitrii Polshakov, Sriniva...
NAACL
1994
13 years 8 months ago
Pattern Matching in a Linguistically-Motivated Text Understanding System
An ongoing debate in text understanding efforts centers on the use of pattern-matching techniques, which some have characterized as "designed to ignore as much text as possib...
Damaris M. Ayuso
LREC
2010
203views Education» more  LREC 2010»
13 years 9 months ago
Arabic Parsing Using Grammar Transforms
We investigate Arabic Context Free Grammar parsing with dependency annotation comparing lexicalised and unlexicalised parsers. We study how morphosyntactic as well as function tag...
Lamia Tounsi, Josef van Genabith
ICDE
2008
IEEE
157views Database» more  ICDE 2008»
14 years 8 months ago
Approximate Clustering on Distributed Data Streams
Abstract-- We investigate the problem of clustering on distributed data streams. In particular, we consider the k-median clustering on stream data arriving at distributed sites whi...
Qi Zhang, Jinze Liu, Wei Wang 0010
INFOCOM
2008
IEEE
14 years 1 months ago
On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm
Abstract—Energy efficiency is critical for wireless sensor networks. The data gathering process must be carefully designed to conserve energy and extend the network lifetime. Fo...
Yan Wu, Sonia Fahmy, Ness B. Shroff