2520 search results - page 355 / 504 » The complexity of approximating entropy |
242
click to vote
ICDE
2003
IEEE
16 years 6 months ago
2003
IEEE
The problem of statistics and aggregate maintenance over data streams has gained popularity in recent years especially in telecommunications network monitoring, trend-related anal...
173
click to vote
KDD
2003
ACM
16 years 5 months ago
2003
ACM
Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technolog...
167
Voted
PODS
2003
ACM
16 years 4 months ago
2003
ACM
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
132
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
144
Voted
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...