Sciweavers

13841 search results - page 2448 / 2769
» Algorithms and Constraint Programming
Sort
View
STTT
2010
97views more  STTT 2010»
15 years 2 months ago
Distributed dynamic partial order reduction
Abstract. Runtime (dynamic) model checking is a promising verification methodology for real-world threaded software because of its many features, the prominent ones being: (i) it ...
Yu Yang, Xiaofang Chen, Ganesh Gopalakrishnan, Rob...
223
Voted
WABI
2010
Springer
188views Bioinformatics» more  WABI 2010»
15 years 2 months ago
Prediction of RNA Secondary Structure Including Kissing Hairpin Motifs
Abstract. We present three heuristic strategies for folding RNA sequences into secondary structures including kissing hairpin motifs. The new idea is to construct a kissing hairpin...
Corinna Theis, Stefan Janssen, Robert Giegerich
CCS
2010
ACM
15 years 2 months ago
Adjustable autonomy for cross-domain entitlement decisions
Cross-domain information exchange is a growing problem, as business and governmental organizations increasingly need to integrate their information systems with those of partially...
Jacob Beal, Jonathan Webb, Michael Atighetchi
CONEXT
2010
ACM
15 years 2 months ago
Assessing the vulnerability of replicated network services
Client-server networks are pervasive, fundamental, and include such key networks as the Internet, power grids, and road networks. In a client-server network, clients obtain a serv...
George Dean Bissias, Brian Neil Levine, Ramesh K. ...
156
Voted
CVPR
2010
IEEE
15 years 2 months ago
Efficient computation of robust low-rank matrix approximations in the presence of missing data using the L1 norm
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
Anders Eriksson, Anton van den Hengel
« Prev « First page 2448 / 2769 Last » Next »