Searching for authors named "Kevin Lang" – sorted by Relevance.
-
Finding good nearly balanced cuts in power law graphs
- Finding good nearly balanced cuts in power law graphs Kevin Lang ∗ November 15, 2004 Abstract
- Cited by 7 (1 self) – Add To MetaCart
-
Random DFA's can be Approximately Learned from Sparse Uniform Examples
- Random DFA's can be Approximately Learned from Sparse Uniform Examples Kevin J. Lang NEC
- Cited by 62 (3 self) – Add To MetaCart
-
and
- Cambridge, MA 02138 and National Bureau of Economic Research and Kevin Lang Department of Economics Boston
- Add To MetaCart
-
Faster Algorithms for Finding Minimal Consistent DFAs
- Faster Algorithms for Finding Minimal Consistent DFAs Kevin J. Lang NEC Research Institute 4
- Cited by 2 (0 self) – Add To MetaCart
-
Fixing two weaknesses of the spectral method
- Fixing two weaknesses of the Spectral Method Kevin J. Lang Yahoo Research 3333 Empire Ave, Burbank
- Cited by 11 (0 self) – Add To MetaCart
-
Local graph partitioning using PageRank vectors
- Fan Chung University of California, San Diego Kevin Lang Yahoo! Research Abstract A local graph
- Cited by 14 (6 self) – Add To MetaCart
-
Results of the Abbadingo One DFA Learning Competition and a New Evidence-Driven State Merging Algorithm
- Algorithm Kevin J. Lang 1 , Barak A. Pearlmutter 2 , and Rodney A. Price 3 1 NEC Research Institute, 4
- Cited by 61 (1 self) – Add To MetaCart
-
A Test Suite for Chess Programs
- Lang and Smith typeset 697 Sep 2, 1993 Chess Test A Test Suite for Chess Programs Kevin J. Lang
- Cited by 3 (0 self) – Add To MetaCart
-
Shape recognition and illusory conjunctions
- SHAPE RECOGNITION AND ILLUSORY CONJUNCTIONS Geoffrey E. Hinton and Kevin J. Lang Computer Science
- Cited by 14 (0 self) – Add To MetaCart
-
Towards Efficiency and Portability: Programming with the BSP Model
- Towards Efficiency and Portability: Programming with the BSP Model Mark Goudreau 1 Kevin Lang 2
- Cited by 34 (3 self) – Add To MetaCart

