Sciweavers

2354 search results - page 239 / 471
» Randomness, Stochasticity and Approximations
Sort
View
SIGCOMM
2010
ACM
15 years 6 months ago
Design and implementation of an "approximate" communication system for wireless media applications
All practical wireless communication systems are prone to errors. At the symbol level such wireless errors have a well-defined structure: when a receiver decodes a symbol erroneou...
Sayandeep Sen, Syed Gilani, Shreesha Srinath, Step...
MST
2010
187views more  MST 2010»
15 years 22 days ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
16 years 6 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
HPDC
2006
IEEE
16 years 1 days ago
Path Grammar Guided Trace Compression and Trace Approximation
Trace-driven simulation is an important technique used in the evaluation of computer architecture innovations. However using it for studying parallel computers and applications is...
Xiaofeng Gao, Allan Snavely, Larry Carter
VLDB
2000
ACM
155views Database» more  VLDB 2000»
15 years 9 months ago
ICICLES: Self-Tuning Samples for Approximate Query Answering
Approximate query answering systems provide very fast alternatives to OLAP systems when applications are tolerant to small errors in query answers. Current sampling-based approach...
Venkatesh Ganti, Mong-Li Lee, Raghu Ramakrishnan