Sciweavers

925 search results - page 84 / 185
» Connectivity on Complete Lattices
Sort
View
IJON
2007
81views more  IJON 2007»
15 years 6 months ago
Statistical analysis of spatially embedded networks: From grid to random node positions
Many conceptual studies of local cortical networks assume completely random wiring. For spatially extended networks, however, such random graph models are inadequate. The geometry...
Nicole Voges, Ad Aertsen, Stefan Rotter
ICRE
2000
IEEE
15 years 10 months ago
Requirements Documentation: Why a Formal Basis is Essential
Unless you have a complete and precise description of your product’s requirements, it is very unlikely that you will satisfy those requirements. A requirements document that is ...
David Lorge Parnas
153
Voted
ICDCS
2007
IEEE
16 years 14 days ago
A Virtual Node-Based Tracking Algorithm for Mobile Networks
— We introduce a virtual-node based mobile object tracking algorithm for mobile sensor networks, VINESTALK. The algorithm uses the Virtual Stationary Automata programming layer, ...
Tina Nolte, Nancy A. Lynch
138
Voted
SRDS
2006
IEEE
16 years 4 days ago
Deleting Files in the Celeste Peer-to-Peer Storage System
Celeste is a robust peer-to-peer object store built on top of a distributed hash table (DHT). Celeste is a working system, developed by Sun Microsystems Laboratories. During the d...
Gal Badishi, Germano Caronni, Idit Keidar, Raphael...
ER
1999
Springer
104views Database» more  ER 1999»
15 years 10 months ago
A Taxonomy of Recursive Relationships and Their Structural Validity in ER Modeling
Abstract. In this paper, we present the complete classification of recursive relationships and the criteria that contribute to the structural validity of modeling recursive relatio...
James Dullea, Il-Yeol Song