332 search results - page 45 / 67 » An Aristotelian notion of size |
KDD
2009
ACM
15 years 10 months ago
2009
ACM
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
107
click to vote
KDD
2007
ACM
15 years 10 months ago
2007
ACM
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
105
click to vote
STOC
2006
ACM
15 years 10 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
176
click to vote
VLDB
2003
ACM
15 years 10 months ago
2003
ACM
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...
167
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
We study the problem of querying relational data embedded in XML. Relational data can be represented by various tree structures in XML. However, current XML query methods, such as...