Sciweavers

2210 search results - page 389 / 442
» Information complexity of neural networks
Sort
View
INFOCOM
2009
IEEE
15 years 8 months ago
ElliPS: A Privacy Preserving Scheme for Sensor Data Storage and Query
—With in-network sensor data storage and query, storage nodes are responsible for storing the data collected by sensor nodes and answering queries from users. Thus, without prope...
Nalin Subramanian, Ka Yang, Wensheng Zhang, Daji Q...
IPPS
2007
IEEE
15 years 8 months ago
A Peer-to-Peer Infrastructure for Autonomous Grid Monitoring
Modern grids have become very complex by their size and their heterogeneity. It makes the deployment and maintenance of systems a difficult task requiring lots of efforts from ad...
Laurent Baduel, Satoshi Matsuoka
DSN
2005
IEEE
15 years 7 months ago
A Wavefront Parallelisation of CTMC Solution Using MTBDDs
In this paper, we present a parallel implementation for the steady-state analysis of continuous-time Markov chains (CTMCs). This analysis is performed via solution of a linear equ...
Yi Zhang, David Parker, Marta Z. Kwiatkowska
INFOCOM
1997
IEEE
15 years 6 months ago
A Distributed Algorithm for Delay-Constrained Unicast Routing
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...
Hussein F. Salama, Douglas S. Reeves, Yannis Vinio...
CP
2007
Springer
15 years 5 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