Sciweavers

272 search results - page 20 / 55
» Some Results on Ordered Structures in Toposes
Sort
View
LICS
2010
IEEE
13 years 6 months ago
Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
Martin Grohe
ECAI
2004
Springer
14 years 1 months ago
Guiding a Theorem Prover with Soft Constraints
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
John K. Slaney, Arnold Binas, David Price
EWSN
2004
Springer
14 years 1 months ago
Networked Slepian-Wolf: Theory and Algorithms
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
Razvan Cristescu, Baltasar Beferull-Lozano, Martin...
CORR
2007
Springer
133views Education» more  CORR 2007»
13 years 8 months ago
On Decidability Properties of Local Sentences
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
Olivier Finkel
BMCBI
2010
161views more  BMCBI 2010»
13 years 5 months ago
LTC: a novel algorithm to improve the efficiency of contig assembly for physical mapping in complex genomes
Background: Physical maps are the substrate of genome sequencing and map-based cloning and their construction relies on the accurate assembly of BAC clones into large contigs that...
Zeev Frenkel, Etienne Paux, David I. Mester, Cathe...