Sciweavers

355 search results - page 22 / 71
» From Moving Edges to Moving Regions
Sort
View
FSTTCS
2008
Springer
13 years 8 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel
VG
2001
13 years 9 months ago
Image-Based Rendering of Surfaces from Volume Data
We present an image-based rendering technique to accelerate surfaces rendering from volume data. We cache the fully volume rendered image (called keyview) and use it to generate n...
Baoquan Chen, Arie E. Kaufman, Qingyu Tang
SIAMDM
2008
84views more  SIAMDM 2008»
13 years 7 months ago
Long Local Searches for Maximal Bipartite Subgraphs
Given a partition of the vertices of a graph into two sets, a flip is a move of a vertex from its own set to the other, under the condition that it has more incident edges to vert...
Hemanshu Kaul, Douglas B. West
JUCS
2007
126views more  JUCS 2007»
13 years 7 months ago
Accepting Networks of Evolutionary Processors with Filtered Connections
: In this paper we simplify a recent model of computation considered in [Margenstern et al. 2005], namely accepting network of evolutionary processors, by moving the filters from ...
Cezara Dragoi, Florin Manea, Victor Mitrana
CVPR
2007
IEEE
14 years 9 months ago
Multi-Layer Background Subtraction Based on Color and Texture
In this paper, we propose a robust multi-layer background subtraction technique which takes advantages of local texture features represented by local binary patterns (LBP) and pho...
Jian Yao, Jean-Marc Odobez