Sciweavers

26 search results - page 5 / 6
» Nearly Tight Bounds for Testing Function Isomorphism
Sort
View
CN
2008
108views more  CN 2008»
13 years 5 months ago
Finding a dense-core in Jellyfish graphs
The connectivity of the Internet crucially depends on the relationships between thousands of Autonomous Systems (ASes) that exchange routing information using the Border Gateway P...
Mira Gonen, Dana Ron, Udi Weinsberg, Avishai Wool
FOCS
2010
IEEE
13 years 3 months ago
The Coin Problem and Pseudorandomness for Branching Programs
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...
Joshua Brody, Elad Verbin
COMBINATORICS
2004
102views more  COMBINATORICS 2004»
13 years 5 months ago
Satisfiability and Computing van der Waerden Numbers
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...
Michael R. Dransfield, Lengning Liu, Victor W. Mar...
FOCS
2010
IEEE
13 years 3 months ago
A Fourier-Analytic Approach to Reed-Muller Decoding
Abstract. We present a Fourier-analytic approach to list-decoding Reed-Muller codes over arbitrary finite fields. We use this to show that quadratic forms over any field are locall...
Parikshit Gopalan
MICCAI
1998
Springer
13 years 10 months ago
Segmentation and Measurement of the Cortex from 3D MR Images
The cortex is the outermost thin layer of gray matter in the brain; geometric measurement of the cortex helps in understanding brain anatomy and function. In the quantitative analy...
Xiaolan Zeng, Lawrence H. Staib, Robert T. Schultz...