Sciweavers

2924 search results - page 574 / 585
» Lower Bounds in Distributed Computing
Sort
View
ICMENS
2003
IEEE
80views Hardware» more  ICMENS 2003»
14 years 27 days ago
Molecular Dynamics Calculations of the Electrostatic Properties of Tubulin and Their Consequences for Microtubules
crystallographic results were made available through the Protein Data Bank (PDB) (entries: ITUB and IJFF) which allowed us to view the 3D atomic resolution structure oftubulin. (se...
J. A. Tuszynski, E. J. Carpenter, E. Crawford, J. ...
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 13 days ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
AINA
2010
IEEE
13 years 12 months ago
A Fully Dynamic and Self-Stabilizing TDMA Scheme for Wireless Ad-hoc Networks
One important challenge in wireless ad hoc networks is to achieve collision free communication. Many MAC layer protocols have been proposed by considering various communication mod...
Bezawada Bruhadeshwar, Kishore Kothapalli, Indira ...
AIPS
2009
13 years 8 months ago
Efficient Solutions to Factored MDPs with Imprecise Transition Probabilities
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
Karina Valdivia Delgado, Scott Sanner, Leliane Nun...
CDC
2009
IEEE
208views Control Systems» more  CDC 2009»
13 years 8 months ago
Sensor selection for hypothesis testing in wireless sensor networks: a Kullback-Leibler based approach
We consider the problem of selecting a subset of p out of n sensors for the purpose of event detection, in a wireless sensor network (WSN). Occurrence or not of the event of intere...
Dragana Bajovic, Bruno Sinopoli, João Xavie...