1477 search results - page 267 / 296 » Pattern Matching with Swaps |
SIGIR
2012
ACM
11 years 10 months ago
2012
ACM
Enterprise search is challenging for several reasons, notably the dynamic terminology and jargon that are specific to the enterprise domain. This challenge is partly addressed by...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
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.)...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
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...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
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 ...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
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 ...