Sciweavers

2080 search results - page 219 / 416
» Measuring empirical computational complexity
Sort
View
ICS
2005
Tsinghua U.
15 years 10 months ago
System noise, OS clock ticks, and fine-grained parallel applications
As parallel jobs get bigger in size and finer in granularity, “system noise” is increasingly becoming a problem. In fact, fine-grained jobs on clusters with thousands of SMP...
Dan Tsafrir, Yoav Etsion, Dror G. Feitelson, Scott...
IPPS
2010
IEEE
15 years 3 months ago
Distributed monitoring of conditional entropy for anomaly detection in streams
In this work we consider the problem of monitoring information streams for anomalies in a scalable and efficient manner. We study the problem in the context of network streams wher...
Chrisil Arackaparambil, Sergey Bratus, Joshua Brod...
ICIP
2003
IEEE
16 years 6 months ago
Shape analysis algorithm based on information theory
In this paper, we describe an algorithm to measure the shape complexity for discrete approximations of planar curves in 2D images and manifold surfaces for 3D triangle meshes. We ...
Andreas Koschan, Besma Roui-Abidi, David L. Page, ...
DAC
2004
ACM
16 years 6 months ago
Synthesizing interconnect-efficient low density parity check codes
Error correcting codes are widely used in communication and storage applications. Codec complexity has usually been measured with a software implementation in mind. A recent hardw...
Marghoob Mohiyuddin, Amit Prakash, Adnan Aziz, Way...
KDD
2006
ACM
153views Data Mining» more  KDD 2006»
16 years 5 months ago
Model compression
Often the best performing supervised learning models are ensembles of hundreds or thousands of base-level classifiers. Unfortunately, the space required to store this many classif...
Cristian Bucila, Rich Caruana, Alexandru Niculescu...