Sciweavers

10997 search results - page 63 / 2200
» On the Structure of Complete Sets
Sort
View
IJDAR
2011
114views more  IJDAR 2011»
13 years 5 months ago
Setting up a competition framework for the evaluation of structure extraction from OCR-ed books
Abstract. This paper describes the setup of the Book Structure Extraction competition run at ICDAR 2009. The goal of the competition was to evaluate and compare automatic technique...
Antoine Doucet, Gabriella Kazai, Bodin Dresevic, A...
MICCAI
2000
Springer
14 years 1 months ago
Robust 3D Segmentation of Anatomical Structures with Level Sets
This paper is focused on the use of the level set formalism to segment anatomical structures in 3D images (ultrasound ou magnetic resonance images). A closed 3D surface propagates...
C. Baillard, Christian Barillot
JCST
2006
65views more  JCST 2006»
13 years 10 months ago
P-Tree Structures and Event Horizon: Efficient Event-Set Implementations
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for...
Katerina Asdre, Stavros D. Nikolopoulos
JSAC
2007
83views more  JSAC 2007»
13 years 10 months ago
Constructing an optimal server set in structured peer-to-peer networks
— To achieve high performance and resilience to failures, a client can make connections with multiple servers simultaneously and receive different portions of the data from each ...
Seung Chul Han, Ye Xia
ISLPED
1995
ACM
125views Hardware» more  ISLPED 1995»
14 years 1 months ago
Transforming set data types to power optimal data structures
In this paper we present a novel approach to model the search space for optimal set data types in network component realisations. The main objective is to arrive at power efficie...
Sven Wuytack, Francky Catthoor, Hugo De Man