Sciweavers

1632 search results - page 65 / 327
» On special numberings of hypergraphs
Sort
View
CORR
2006
Springer
105views Education» more  CORR 2006»
15 years 6 months ago
Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II: A Simple Example
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...
Joel Friedman
CORR
2007
Springer
75views Education» more  CORR 2007»
15 years 6 months ago
Polyhedral representation conversion up to symmetries
We give a short survey on computational techniques which can be used to solve the representation conversion problem for polyhedra up to symmetries. In particular we discuss decompo...
David Bremner, Mathieu Dutour Sikiric, Achill Sch&...
CORR
2007
Springer
89views Education» more  CORR 2007»
15 years 6 months ago
The Isoconditioning Loci of Planar Three-DOF Parallel Manipulators
: This paper deals with a special class of three-degree-of-freedom parallel manipulators. First, the singular configurations of the two Jacobian matrices are studied. The isotropic...
Damien Chablat, Stéphane Caro, Philippe Wen...
MP
2006
121views more  MP 2006»
15 years 6 months ago
Approximate fixed-rank closures of covering problems
Consider a 0/1 integer program min{cT x : Ax b, x {0, 1}n } where A is nonnegative. We show that if the number of minimal covers of Ax b is polynomially bounded, then there is ...
Daniel Bienstock, Mark Zuckerberg
IJFCS
2007
63views more  IJFCS 2007»
15 years 6 months ago
Path-Equivalent Developments in Acyclic Weighted Automata
Weighted finite automata (WFA) are used with FPGA accelerating hardware to scan large genomic banks. Hardwiring such automata raises surface area and clock frequency constraints,...
Mathieu Giraud, Philippe Veber, Dominique Lavenier