Sciweavers

2080 search results - page 320 / 416
» Measuring empirical computational complexity
Sort
View
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
16 years 6 months ago
A fast algorithm for finding frequent episodes in event streams
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...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan
SPRINGSIM
2007
15 years 7 months ago
Eve: a measurement-centric emulation environment for adaptive internet servers
Emulation plays a central role in the performance evaluation, capacity planning, and workload characterization of servers and data centers. Emulation tools usually require develop...
Hani Jamjoom, Chang-Hao Tsai, Kang G. Shin, Sharad...
SIAMCOMP
1998
86views more  SIAMCOMP 1998»
15 years 6 months ago
Exact Learning of Discretized Geometric Concepts
We first present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept defined by the union of m axis-parallel boxes in d-...
Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldm...
MOBISYS
2009
ACM
16 years 6 months ago
Longitudinal study of a building-scale RFID ecosystem
Radio Frequency IDentification (RFID) deployments are becoming increasingly popular in both industrial and consumer-oriented settings. To effectively exploit and operate such depl...
Evan Welbourne, Karl Koscher, Emad Soroush, Magdal...
CONEXT
2009
ACM
15 years 7 months ago
FairTorrent: bringing fairness to peer-to-peer systems
Peer-to-Peer file-sharing applications suffer from a fundamental problem of unfairness. Free-riders cause slower download times for others by contributing little or no upload band...
Alex Sherman, Jason Nieh, Clifford Stein