Sciweavers

480 search results - page 52 / 96
» Algorithmic tests and randomness with respect to a class of ...
Sort
View
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
14 years 2 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
14 years 8 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...
CHARME
2003
Springer
97views Hardware» more  CHARME 2003»
13 years 11 months ago
Coverage Metrics for Formal Verification
In formal verification, we verify that a system is correct with respect to a specification. Even when the system is proven to be correct, there is still a question of how complete ...
Hana Chockler, Orna Kupferman, Moshe Y. Vardi
ECAL
2001
Springer
14 years 3 days ago
Symbiotic Composition and Evolvability
Several of the Major Transitions in natural evolution, such as the symbiogenic origin of eukaryotes from prokaryotes, share the feature that existing entities became the components...
Richard A. Watson, Jordan B. Pollack
CSB
2003
IEEE
14 years 28 days ago
An SVM-based Algorithm for Identification of Photosynthesis-specific Genome Features
This paper presents a novel algorithm for identification and functional characterization of “key” genome features responsible for a particular biochemical process of interest....
Gong-Xin Yu, George Ostrouchov, Al Geist, Nagiza F...