Sciweavers

2661 search results - page 230 / 533
» Quantum Complexity Classes
Sort
View
SP
2002
IEEE
165views Security Privacy» more  SP 2002»
15 years 6 months ago
NINJA: Java for high performance numerical computing
When Java was first introduced, there was a perception that its many benefits came at a significant performance cost. In the particularly performance-sensitive field of numerical ...
José E. Moreira, Samuel P. Midkiff, Manish ...
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 4 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker
BMCBI
2010
107views more  BMCBI 2010»
15 years 1 months ago
Interaction prediction and classification of PDZ domains
Background: PDZ domain is a well-conserved, structural protein domain found in hundreds of signaling proteins that are otherwise unrelated. PDZ domains can bind to the C-terminal ...
Sibel Kalyoncu, Ozlem Keskin, Attila Gürsoy
ICDE
2011
IEEE
220views Database» more  ICDE 2011»
14 years 10 months ago
Generating test data for killing SQL mutants: A constraint-based approach
—Complex SQL queries are widely used today, but it is rather difficult to check if a complex query has been written correctly. Formal verification based on comparing a specifi...
Shetal Shah, S. Sudarshan, Suhas Kajbaje, Sandeep ...
JMLR
2012
13 years 9 months ago
Fast interior-point inference in high-dimensional sparse, penalized state-space models
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...
Eftychios A. Pnevmatikakis, Liam Paninski