Sciweavers

1700 search results - page 281 / 340
» Processing XML with Java
Sort
View
ICDE
2004
IEEE
115views Database» more  ICDE 2004»
14 years 9 months ago
Unordered Tree Mining with Applications to Phylogeny
Frequent structure mining (FSM) aims to discover and extract patterns frequently occurring in structural data, such as trees and graphs. FSM finds many applications in bioinformat...
Dennis Shasha, Jason Tsong-Li Wang, Sen Zhang
ICDE
2002
IEEE
136views Database» more  ICDE 2002»
14 years 9 months ago
Mixing Querying and Navigation in MIX
Web-based information systems provide to their users the ability to interleave querying and browsing during their information discovery efforts. The MIX system provides an API cal...
Pratik Mukhopadhyay, Yannis Papakonstantinou
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
14 years 8 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...
ICFP
2006
ACM
14 years 7 months ago
An object-oriented approach to datatype-generic programming
Datatype-generic programming (DGP) is the next step beyond abstracting over types using parametric polymorphism, which is often called "genericity" in object-oriented la...
Adriaan Moors, Frank Piessens, Wouter Joosen
ICFP
2004
ACM
14 years 7 months ago
Regular expression patterns
We extend Haskell with regular expression patterns. Regular expression patterns provide means for matching and extracting data which goes well beyond ordinary pattern matching as ...
Niklas Broberg, Andreas Farre, Josef Svenningsson