Sciweavers

36 search results - page 5 / 8
» A new family of locally 5-arc transitive graphs
Sort
View
92
Voted
ECCC
2010
83views more  ECCC 2010»
14 years 9 months ago
Symmetric LDPC codes are not necessarily locally testable
Locally testable codes, i.e., codes where membership in the code is testable with a constant number of queries, have played a central role in complexity theory. It is well known t...
Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu ...
94
Voted
LPAR
2010
Springer
14 years 10 months ago
Clause Elimination Procedures for CNF Formulas
Abstract. We develop and analyze clause elimination procedures, a specific family of simplification techniques for conjunctive normal form (CNF) formulas. Extending known procedu...
Marijn Heule, Matti Järvisalo, Armin Biere
DMCS
2003
15 years 1 months ago
A symbolic projection of Langton's Ant
d Abstract) Anah´ı Gajardo† GI2MA, Departamento de Ingenier´ıa Matem´atica, Universidad de Concepci´on, Casilla 160-C, correo 3, Concepci´on, Chile The Langton’s ant is ...
Anahí Gajardo
CSB
2005
IEEE
152views Bioinformatics» more  CSB 2005»
15 years 5 months ago
Consensus Genetic Maps: A Graph Theoretic Approach
A genetic map is an ordering of genetic markers constructed from genetic linkage data for use in linkage studies and experimental design. While traditional methods have focused on...
Benjamin G. Jackson, Srinivas Aluru, Patrick S. Sc...
CVPR
2007
IEEE
15 years 6 months ago
Accurate Dynamic Sketching of Faces from Video
A sketch captures the most informative part of an object, in a much more concise and potentially robust representation (e.g., for face recognition or new capabilities of manipulat...
Zijian Xu, Jiebo Luo