Sciweavers

35 search results - page 7 / 7
» What Happened in CLEF 2005
Sort
View
SIGECOM
2005
ACM
97views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
Complexity of (iterated) dominance
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
Vincent Conitzer, Tuomas Sandholm
FM
2005
Springer
156views Formal Methods» more  FM 2005»
14 years 1 months ago
Testing Concurrent Object-Oriented Systems with Spec Explorer
Abstract Colin Campbell, Wolfgang Grieskamp, Lev Nachmanson, Wolfram Schulte, Nikolai Tillmann, and Margus Veanes Microsoft Research, Redmond, WA, USA Abstract. We describe a pract...
Colin Campbell, Wolfgang Grieskamp, Lev Nachmanson...
AML
2005
101views more  AML 2005»
13 years 7 months ago
Forcing and antifoundation
It is proved that the forcing apparatus can be built and set to work in ZFCA (=ZFC minus foundation plus the antifoundation axiom AFA). The key tools for this construction are gre...
Athanassios Tzouvaras
BMCBI
2005
114views more  BMCBI 2005»
13 years 7 months ago
Extension of Lander-Waterman theory for sequencing filtered DNA libraries
Background: The degree to which conventional DNA sequencing techniques will be successful for highly repetitive genomes is unclear. Investigators are therefore considering various...
Michael C. Wendl, W. Bradley Barbazuk
CAD
2005
Springer
13 years 7 months ago
Optimizing the topological and combinatorial complexity of isosurfaces
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
Carlos Andújar, Pere Brunet, Antoni Chica, ...