Sciweavers

303 search results - page 48 / 61
» Discrete Mathematics for Computer Science, Some Notes
Sort
View
BMCBI
2008
77views more  BMCBI 2008»
15 years 20 days ago
Stochastic models for the in silico simulation of synaptic processes
Background: Research in life sciences is benefiting from a large availability of formal description techniques and analysis methodologies. These allow both the phenomena investiga...
Andrea Bracciali, Marcello Brunelli, Enrico Catald...
COMPUTER
2006
84views more  COMPUTER 2006»
15 years 18 days ago
Testable, Reusable Units of Cognition
The educational content of a technical topic consists, ultimately, of elementary chunks of knowledge. Identifying and classifying such units -- Testable, Reusable Units of Cogniti...
Bertrand Meyer
IMC
2007
ACM
15 years 2 months ago
Legal issues surrounding monitoring during network research
This work was motivated by a discussion that two of the coauthors (computer science professors) had with the other coauthor (a law professor and a former computer crime Trial Atto...
Douglas C. Sicker, Paul Ohm, Dirk Grunwald
86
Voted
SAC
2009
ACM
15 years 7 months ago
On a discretizable subclass of instances of the molecular distance geometry problem
The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we di...
Carlile Lavor, Leo Liberti, Antonio Mucherino, Nel...
107
Voted
IPSN
2004
Springer
15 years 6 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...