Sciweavers

47 search results - page 3 / 10
» Contiguity Orders
Sort
View
ICDAR
2005
IEEE
13 years 12 months ago
A Novel Approach to Recover Writing Order From Single Stroke Offline Handwritten Images
Problem of recovering a writing order from singlestroked handwritten image can be seen as finding the smoothest Euler path in its graph representation. In this paper, a novel appr...
Yu Qiao, Makoto Yasuhara
SSDBM
2010
IEEE
105views Database» more  SSDBM 2010»
13 years 11 months ago
Organization of Data in Non-convex Spatial Domains
We present a technique for organizing data in spatial databases with non-convex domains based on an automatic characterization using the medial-axis transform (MAT). We define a t...
Eric A. Perlman, Randal C. Burns, Michael M. Kazhd...
CORR
2011
Springer
161views Education» more  CORR 2011»
13 years 26 days ago
On Parsimonious Explanations for 2-D Tree- and Linearly-Ordered Data
This paper studies the “explanation problem” for tree- and linearly-ordered array data, a problem motivated by database applications and recently solved for the one-dimensiona...
Howard J. Karloff, Flip Korn, Konstantin Makaryche...
CCGRID
2009
IEEE
14 years 1 months ago
Improving Parallel Write by Node-Level Request Scheduling
In a cluster of multiple processors or cpu-cores, many processes may run on each compute node. Each process tends to issue contiguous I/O requests for snapshot, checkpointing or s...
Kazuki Ohta, Hiroya Matsuba, Yutaka Ishikawa
SIBGRAPI
2006
IEEE
14 years 11 days ago
Polygonization of volumetric reconstructions from silhouettes
In this work we propose a method for the polygonization of octree-based reconstructions by dual contouring. Dual contouring is an adaptive method for determining contiguous polygo...
Anselmo Antunes Montenegro, Luiz Velho, Paulo Ceza...