Sciweavers

2479 search results - page 477 / 496
» A Computational Theory of Working Memory
Sort
View
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
14 years 7 months ago
Extractors for a constant number of polynomially small min-entropy independent sources
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
Anup Rao
ICALP
2009
Springer
14 years 7 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty
SIGMOD
2008
ACM
162views Database» more  SIGMOD 2008»
14 years 7 months ago
Event queries on correlated probabilistic streams
A major problem in detecting events in streams of data is that the data can be imprecise (e.g. RFID data). However, current state-ofthe-art event detection systems such as Cayuga ...
Christopher Ré, Dan Suciu, Julie Letchner, ...
ICSE
2007
IEEE-ACM
14 years 7 months ago
A Future for Software Engineering?
This paper suggests the need for a software engineering research community conversation about the future that the community would like to have. The paper observes that the researc...
Leon J. Osterweil
MOBIHOC
2004
ACM
14 years 7 months ago
Rate allocation in wireless sensor networks with network lifetime requirement
An important performance consideration for wireless sensor networks is the amount of information collected by all the nodes in the network over the course of network lifetime. Sin...
Yiwei Thomas Hou, Yi Shi, Hanif D. Sherali