Sciweavers

4378 search results - page 189 / 876
» On the Complexity of Ordered Colourings
Sort
View
BSL
2000
153views more  BSL 2000»
15 years 6 months ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
Jan Krajícek, Thomas Scanlon
RECOMB
2010
Springer
15 years 5 months ago
Consistency of Sequence-Based Gene Clusters
In comparative genomics, various combinatorial models can be used to specify gene clusters — groups of genes that are co-located in a set of genomes. Several approaches have been...
Roland Wittler, Jens Stoye
DAM
2011
15 years 1 months ago
A General Label Search to investigate classical graph search algorithms
Many graph search algorithms use a labeling of the vertices to compute an ordering of the vertices. We generalize this idea by devising a general vertex labeling algorithmic proce...
Richard Krueger, Geneviève Simonet, Anne Be...
CVPR
2007
IEEE
16 years 8 months ago
Fast 3D Scanning with Automatic Motion Compensation
We present a novel 3D scanning system combining stereo and active illumination based on phase-shift for robust and accurate scene reconstruction. Stereo overcomes the traditional ...
Thibaut Weise, Bastian Leibe, Luc J. Van Gool
ICMCS
2008
IEEE
129views Multimedia» more  ICMCS 2008»
16 years 1 months ago
Evaluation of segment-based proxy caching for video on demand
In this paper, we derive an analytical model for the evaluation of the performance of a Video on Demand (VoD) system. The model estimates the mean waiting time achievable by the P...
Muhammad Muhammad, Wei Tu, Eckehard G. Steinbach