9842 search results - page 1783 / 1969 » Problem complexity |
200
Voted
DASFAA
2005
IEEE
16 years 18 days ago
2005
IEEE
Finding bursts in data streams is attracting much attention in research community due to its broad applications. Existing burst detection methods suffer the problems that 1) the p...
210
click to vote
SBCCI
2005
ACM
16 years 16 days ago
2005
ACM
This work addresses the problem of application mapping in networks-on-chip (NoCs). It explores the importance of characterizing network traffic to effectively predict NoC energy c...
178
Voted
GD
2005
Springer
16 years 15 days ago
2005
Springer
Visualizing and analyzing social networks is a challenging problem that has been receiving growing attention. An important first step, before analysis can begin, is ensuring that...
191
Voted
PKDD
2005
Springer
16 years 14 days ago
2005
Springer
Abstract. The paradigm of pattern discovery based on constraints was introduced with the aim of providing to the user a tool to drive the discovery process towards potentially inte...
161
Voted
STACS
2005
Springer
16 years 13 days ago
2005
Springer
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounde...