Sciweavers

3123 search results - page 475 / 625
» Focusing on pattern matching
Sort
View
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 5 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
SIGMOD
2007
ACM
195views Database» more  SIGMOD 2007»
16 years 4 months ago
Effective variation management for pseudo periodical streams
Many database applications require the analysis and processing of data streams. In such systems, huge amounts of data arrive rapidly and their values change over time. The variati...
Lv-an Tang, Bin Cui, Hongyan Li, Gaoshan Miao, Don...
142
Voted
SIGMOD
2004
ACM
156views Database» more  SIGMOD 2004»
16 years 4 months ago
Tree Logical Classes for Efficient Evaluation of XQuery
XML is widely praised for its flexibility in allowing repeated and missing sub-elements. However, this flexibility makes it challenging to develop a bulk algebra, which typically ...
Stelios Paparizos, Yuqing Wu, Laks V. S. Lakshmana...
ICFP
2005
ACM
16 years 4 months ago
High-level views on low-level representations
This paper explains how the high-level treatment of datatypes in functional languages--using features like constructor functions and pattern matching--can be made to coexist with ...
Iavor S. Diatchki, Mark P. Jones, Rebekah Leslie
ICFP
2003
ACM
16 years 4 months ago
FreshML: programming with binders made simple
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay