Sciweavers

1287 search results - page 26 / 258
» Self-Normalized Linear Tests
Sort
View
APPROX
2009
Springer
135views Algorithms» more  APPROX 2009»
15 years 10 months ago
Tolerant Linearity Testing and Locally Testable Codes
Abstract. We study tolerant linearity testing under general distributions. Given groups G and H, a distribution µ on G, and oracle access to a function f : G → H, we consider th...
Swastik Kopparty, Shubhangi Saraf
125
Voted
ETS
2006
IEEE
119views Hardware» more  ETS 2006»
15 years 9 months ago
On-Chip Test Generation Using Linear Subspaces
A central problem in built-in self test (BIST) is how to efficiently generate a small set of test vectors that detect all targeted faults. We propose a novel solution that uses l...
Ramashis Das, Igor L. Markov, John P. Hayes
JMLR
2010
161views more  JMLR 2010»
14 years 10 months ago
Training and Testing Low-degree Polynomial Data Mappings via Linear SVM
Kernel techniques have long been used in SVM to handle linearly inseparable problems by transforming data to a high dimensional space, but training and testing large data sets is ...
Yin-Wen Chang, Cho-Jui Hsieh, Kai-Wei Chang, Micha...
146
Voted
ICML
2007
IEEE
16 years 4 months ago
A fast linear separability test by projection of positive points on subspaces
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
A. P. Yogananda, M. Narasimha Murty, Lakshmi Gopal
GD
2003
Springer
15 years 8 months ago
Radial Level Planarity Testing and Embedding in Linear Time
A graph with an ordered k-partition of the vertices is radial level planar if there is a strictly outward drawing on k concentric levels without crossings. Radial level planarity ...
Christian Bachmaier, Franz-Josef Brandenburg, Mich...