Sciweavers

1640 search results - page 194 / 328
» Deriving Private Information from Randomized Data
Sort
View
121
Voted
INFOCOM
2003
IEEE
15 years 9 months ago
On Multicast Trees: Structure and Size Estimation
Abstract— This work presents a thorough investigation of the structure of multicast trees cut from the Internet and power-law topologies. Based on both generated topologies and r...
Danny Dolev, Osnat Mokryn, Yuval Shavitt
150
Voted
QEST
2010
IEEE
15 years 1 months ago
On the Theory of Stochastic Processors
Traditional architecture design approaches hide hardware uncertainties from the software stack through overdesign, which is often expensive in terms of power consumption. The recen...
Parasara Sridhar Duggirala, Sayan Mitra, Rakesh Ku...
147
Voted
NIPS
2008
15 years 5 months ago
Characterizing neural dependencies with copula models
The coding of information by neural populations depends critically on the statistical dependencies between neuronal responses. However, there is no simple model that can simultane...
Pietro Berkes, Frank Wood, Jonathan Pillow
ICDE
1996
IEEE
157views Database» more  ICDE 1996»
16 years 5 months ago
High Availability in Clustered Multimedia Servers
Clustered multimedia servers, consisting of interconnected nodes and disks, have been proposed for large scale servers, that are capable of supporting multiple concurrent streams ...
Renu Tewari, Daniel M. Dias, Rajat Mukherjee, Harr...
135
Voted
CP
2007
Springer
15 years 7 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti