Sciweavers

13603 search results - page 140 / 2721
» On the Complexity of Computing Treelength
Sort
View
KES
1998
Springer
14 years 1 months ago
Attractor systems and analog computation
Attractor systems are useful in neurodynamics,mainly in the modelingof associative memory. Thispaper presentsa complexity theory for continuous phase space dynamical systems with ...
Hava T. Siegelmann, Shmuel Fishman
CORR
2011
Springer
195views Education» more  CORR 2011»
13 years 4 months ago
Simplicial Homology of Random Configurations
Given a Poisson process on a d-dimensional torus, its random geometric simplicial complex is the complex whose vertices are the points of the Poisson process and simplices are give...
Laurent Decreusefond, Eduardo Ferraz, Hugues Randr...
TPDS
2008
125views more  TPDS 2008»
13 years 9 months ago
Computation-Efficient Multicast Key Distribution
Efficient key distribution is an important problem for secure group communications. The communication and storage complexity of multicast key distribution problem has been studied ...
Lihao Xu, Cheng Huang
MFCS
1992
Springer
14 years 1 months ago
The Complexity of Graph Connectivity
In this paper we survey the major developments in understanding the complexity of the graph connectivity problem in several computational models, and highlight some challenging op...
Avi Wigderson
MIDDLEWARE
2010
Springer
13 years 8 months ago
Adapting Distributed Real-Time and Embedded Pub/Sub Middleware for Cloud Computing Environments
Enterprise distributed real-time and embedded (DRE) publish/subscribe (pub/sub) systems manage resources and data that are vital to users. Cloud computing—where computing resourc...
Joe Hoffert, Douglas C. Schmidt, Aniruddha S. Gokh...