13214 search results - page 2354 / 2643 » Pseudorandomness for network algorithms |
208
Voted
FLAIRS
2010
15 years 9 months ago
2010
The ability to mine data represented as a graph has become important in several domains for detecting various structural patterns. One important area of data mining is anomaly det...
210
click to vote
MOBISYS
2010
ACM
15 years 9 months ago
2010
ACM
Mobile phones are becoming increasingly sophisticated with a rich set of on-board sensors and ubiquitous wireless connectivity. However, the ability to fully exploit the sensing c...
186
Voted
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficien...
169
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
191
click to vote
DEBS
2008
ACM
15 years 8 months ago
2008
ACM
A significant number of emerging on-line data analysis applications require the processing of data streams, large amounts of data that get updated continuously, to generate output...