Sciweavers

29908 search results - page 5975 / 5982
» On the complexity of communication complexity
Sort
View
FSTTCS
2009
Springer
14 years 2 months ago
Fractional Pebbling and Thrifty Branching Programs
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
SMA
2009
ACM
185views Solid Modeling» more  SMA 2009»
14 years 2 months ago
A dynamic data structure for flexible molecular maintenance and informatics
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...
Chandrajit L. Bajaj, Rezaul Alam Chowdhury, Muhibu...
CISS
2008
IEEE
14 years 2 months ago
Information theory based estimator of the number of sources in a sparse linear mixing model
—In this paper we present an Information Theoretic Estimator for the number of sources mutually disjoint in a linear mixing model. The approach follows the Minimum Description Le...
Radu Balan
GI
2007
Springer
14 years 1 months ago
Auf dem Weg zur allwissenden Fabrik: Vertikale Integration auf Basis kontinuierlicher Datenverarbeitung
: In modernen Produktionsunternehmen gilt mehr denn je die Devise Zeit ist Geld. Daher ist eine zeitnahe Reaktion auf Vorfälle und Entwicklungen innerhalb der eigenen Produktion a...
Christoph Heinz, Jürgen Krämer, Tobias R...
ICSE
2007
IEEE-ACM
14 years 1 months ago
ACL2s: "The ACL2 Sedan"
ACL2 is the latest inception of the Boyer-Moore theorem prover, the 2005 recipient of the ACM Software System Award. In the hands of an expert, it feels like a finely tuned race ...
Peter C. Dillinger, Panagiotis Manolios, Daron Vro...
« Prev « First page 5975 / 5982 Last » Next »