Sciweavers

4908 search results - page 689 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
DC
2010
15 years 6 months ago
Refined quorum systems
It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform f...
Rachid Guerraoui, Marko Vukolic
INFORMATICALT
2006
89views more  INFORMATICALT 2006»
15 years 6 months ago
Investigation of Examples of E-Education Environment for Scientific Collaboration and Distance Graduate Studies, Part 1
The objective is to investigate two emerging information technologies in graduate studies and scientific cooperation. Internet is the first technology. The open source is the secon...
Jonas Mockus
PERVASIVE
2008
Springer
15 years 6 months ago
Localized power-aware routing in linear wireless sensor networks
Energy-efficency is a key concern when designing protocols for wireless sensor networks (WSN). This is of particular importance in commercial applications where demonstrable retur...
Marco Zimmerling, Waltenegus Dargie, Johnathan M. ...
BMCBI
2005
87views more  BMCBI 2005»
15 years 6 months ago
Efficient decoding algorithms for generalized hidden Markov model gene finders
Background: The Generalized Hidden Markov Model (GHMM) has proven a useful framework for the task of computational gene prediction in eukaryotic genomes, due to its flexibility an...
William H. Majoros, Mihaela Pertea, Arthur L. Delc...
JUCS
2007
93views more  JUCS 2007»
15 years 6 months ago
Quality of Service Routing in a MANET with OLSR
: Ad hoc wireless networks have enormous commercial and military potential because of their self-organizing capacity and mobility support. However, some specificities of these net...
Dang-Quan Nguyen, Pascale Minet