Sciweavers

2596 search results - page 516 / 520
» Classes and clusters in data analysis
Sort
View
PODC
2006
ACM
14 years 3 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
EDBT
2009
ACM
116views Database» more  EDBT 2009»
14 years 2 months ago
Ranking objects based on relationships and fixed associations
Text corpora are often enhanced by additional metadata which relate real-world entities, with each document in which such entities are discussed. Such relationships are typically ...
Albert Angel, Surajit Chaudhuri, Gautam Das, Nick ...
ICDCS
2000
IEEE
14 years 2 months ago
An Adaptive, Perception-Driven Error Spreading Scheme in Continuous Media Streaming
For transmission of continuous media (CM) streams such as audio and video over the Internet, a critical issue is that periodic network overloads cause bursty packet losses. Studie...
Srivatsan Varadarajan, Hung Q. Ngo, Jaideep Srivas...
CHI
1997
ACM
14 years 2 months ago
The Amulet User Interface Development Environment
—The Amulet user interface development environment makes it easier for programmers to create highly-interactive, graphical user interface software for Unix, Windows and the Macin...
Brad A. Myers, Richard G. McDaniel, Robert C. Mill...
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
14 years 1 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts