Sciweavers

4324 search results - page 230 / 865
» A Generalized Representer Theorem
Sort
View
SPAA
2000
ACM
15 years 11 months ago
DCAS-based concurrent deques
The computer industry is currently examining the use of strong synchronization operations such as double compareand-swap (DCAS) as a means of supporting non-blocking synchronizati...
Ole Agesen, David Detlefs, Christine H. Flood, Ale...
JCP
2008
116views more  JCP 2008»
15 years 6 months ago
Formal Verification and Visualization of Security Policies
Verified and validated security policies are essential components of high assurance computer systems. The design and implementation of security policies are fundamental processes i...
Luay A. Wahsheh, Daniel Conte de Leon, Jim Alves-F...
BMCBI
2005
137views more  BMCBI 2005»
15 years 6 months ago
A configuration space of homologous proteins conserving mutual information and allowing a phylogeny inference based on pair-wise
Background: Popular methods to reconstruct molecular phylogenies are based on multiple sequence alignments, in which addition or removal of data may change the resulting tree topo...
Olivier Bastien, Philippe Ortet, Sylvaine Roy, Eri...
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
16 years 1 months ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...
AAAI
1993
15 years 8 months ago
On the Adequateness of the Connection Method
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
Antje Beringer, Steffen Hölldobler