Sciweavers

1522 search results - page 138 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
SIGMETRICS
2002
ACM
161views Hardware» more  SIGMETRICS 2002»
14 years 9 months ago
Performance study of dispatching algorithms in multi-tier web architectures
The number and heterogeneity of requests to Web sites are increasing also because the Web technology is becoming the preferred interface for information systems. Many systems host...
Mauro Andreolini, Michele Colajanni, Ruggero Morse...
VLDB
2002
ACM
97views Database» more  VLDB 2002»
14 years 9 months ago
Incorporating XSL Processing into Database Engines
The two observations that 1) many XML documents are stored in a database or generated from data stored in a database and 2) processing these documents with XSL stylesheet processo...
Guido Moerkotte
IJISEC
2008
188views more  IJISEC 2008»
14 years 8 months ago
Complete analysis of configuration rules to guarantee reliable network security policies
Abstract The use of different network security components, such as firewalls and network intrusion detection systems (NIDSs), is the dominant method to monitor and guarantee the se...
Joaquín García-Alfaro, Nora Boulahia...
RECOMB
2010
Springer
14 years 8 months ago
Consistency of Sequence-Based Gene Clusters
In comparative genomics, various combinatorial models can be used to specify gene clusters — groups of genes that are co-located in a set of genomes. Several approaches have been...
Roland Wittler, Jens Stoye
SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
14 years 8 months ago
Computing Stable Outcomes in Hedonic Games
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
Martin Gairing, Rahul Savani