Sciweavers

3913 search results - page 247 / 783
» complexity 2006
Sort
View
PC
2000
93views Management» more  PC 2000»
15 years 5 months ago
Scheduling outtrees of height one in the LogP model
The LogP model is a model of parallel computation that characterises a parallel computer system by four parameters: the latency L, the overhead o, the gap g and the number of proc...
Jacques Verriet
IJDAR
2002
108views more  IJDAR 2002»
15 years 5 months ago
Document understanding for a broad class of documents
We present a document analysis system able to assign logical labels and extract the reading order in a broad set of documents. All information sources, from geometric features and ...
Marco Aiello, Christof Monz, Leon Todoran
IJFCS
2002
122views more  IJFCS 2002»
15 years 5 months ago
The Delaunay Hierarchy
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
Olivier Devillers
IJON
2002
67views more  IJON 2002»
15 years 5 months ago
Test of spike-sorting algorithms on the basis of simulated network data
: Results of spike sorting algorithms are usually compared against recorded signals which themselves underly interpretations, distortions and errors. Our approach is to provide and...
Kerstin M. L. Menne, Andre Folkers, Thomas Malina,...
IJON
2002
82views more  IJON 2002»
15 years 5 months ago
Functional imaging and neuronal information processing
Since the functional magnetic resonance imaging (fMRI) signal is likely to re ect a spatial average of the activity of neurons with partly dissimilar response properties, its inte...
Angel Nevado, Malcolm P. Young, Stefano Panzeri