Sciweavers

1096 search results - page 194 / 220
» Computation Slicing: Techniques and Theory
Sort
View
FOCS
2008
IEEE
14 years 3 months ago
Almost-Natural Proofs
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
Timothy Y. Chow
IPSN
2007
Springer
14 years 3 months ago
Sparse data aggregation in sensor networks
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
SIGMETRICS
2006
ACM
114views Hardware» more  SIGMETRICS 2006»
14 years 3 months ago
On suitability of Euclidean embedding of internet hosts
In this paper, we investigate the suitability of embedding Internet hosts into a Euclidean space given their pairwise distances (as measured by round-trip time). Using the classic...
Sanghwan Lee, Zhi-Li Zhang, Sambit Sahu, Debanjan ...
ASAP
2003
IEEE
133views Hardware» more  ASAP 2003»
14 years 2 months ago
Storage Management in Process Networks using the Lexicographically Maximal Preimage
At the Leiden Embedded Research Center, we are developing a compiler called Compaan that automatically translates signal processing applications written in Matlab into Kahn Proces...
Alexandru Turjan, Bart Kienhuis
PODS
2010
ACM
242views Database» more  PODS 2010»
14 years 2 months ago
Certain answers for XML queries
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
Claire David, Leonid Libkin, Filip Murlak