Sciweavers

1088 search results - page 98 / 218
» A Bayesian Approach to Tackling Hard Computational Problems
Sort
View
GD
2006
Springer
14 years 2 months ago
Parameterized st -Orientations of Graphs: Algorithms and Experiments
st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the pas...
Charalampos Papamanthou, Ioannis G. Tollis
WABI
2005
Springer
109views Bioinformatics» more  WABI 2005»
14 years 4 months ago
Optimal Protein Threading by Cost-Splitting
Abstract. In this paper, we use integer programming approach for solving a hard combinatorial optimization problem, namely protein threading. For this sequence-to-structure alignme...
Philippe Veber, Nicola Yanev, Rumen Andonov, Vince...
ECCC
2007
123views more  ECCC 2007»
13 years 10 months ago
Lossy Trapdoor Functions and Their Applications
We propose a general cryptographic primitive called lossy trapdoor functions (lossy TDFs), and use it to develop new approaches for constructing several important cryptographic to...
Chris Peikert, Brent Waters
P2P
2008
IEEE
14 years 5 months ago
Scalable Resource Annotation in Peer-to-Peer Grids
Peer-to-peer grids are large-scale, dynamic environments where autonomous sites share computing resources. Producing and maintaining relevant and up-to-date resource information i...
Nazareno Andrade, Elizeu Santos-Neto, Francisco Vi...
SAS
2009
Springer
212views Formal Methods» more  SAS 2009»
14 years 11 months ago
The Causal Graph Revisited for Directed Model Checking
Directed model checking is a well-established technique to tackle the state explosion problem when the aim is to find error states in large systems. In this approach, the state spa...
Martin Wehrle, Malte Helmert