Sciweavers

1287 search results - page 123 / 258
» Self-Normalized Linear Tests
Sort
View
CSR
2009
Springer
14 years 3 months ago
On the Complexity of Matroid Isomorphism Problems
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
B. V. Raghavendra Rao, Jayalal M. N. Sarma
GCC
2004
Springer
14 years 2 months ago
Distributed MD4 Password Hashing with Grid Computing Package BOINC
Distributed computing on heterogeneous nodes, or grid computing, provides a substantial increase in computational power available for many applications. This paper reports our expe...
Stephen Pellicer, Yi Pan, Minyi Guo
COCOON
2001
Springer
14 years 1 months ago
PC-Trees vs. PQ-Trees
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
Wen-Lian Hsu
ICIP
2008
IEEE
14 years 11 months ago
LASIC: A model invariant framework for correspondence
In this paper we address two closely related problems. The first is the object detection problem, i.e., the automatic decision of whether a given image represents a known object o...
Bernardo Rodrigues Pires, João Xavier, Jos&...
ICIP
2006
IEEE
14 years 10 months ago
An Architecture for Compressive Imaging
Compressive Sensing is an emerging field based on the revelation that a small group of non-adaptive linear projections of a compressible signal contains enough information for rec...
Michael B. Wakin, Jason N. Laska, Marco F. Duarte,...