Sciweavers

2593 search results - page 79 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
DATAMINE
2010
120views more  DATAMINE 2010»
15 years 2 months ago
A weighted voting summarization of SOM ensembles
Abstract Weighted Voting Superposition (WeVoS) is a novel summarization algorithm for the results of an ensemble of Self-Organizing Maps. Its principal aim is to achieve the lowest...
Bruno Baruque, Emilio Corchado
CGF
2005
69views more  CGF 2005»
15 years 2 months ago
Structure Preserving CAD Model Repair
There are two major approaches for converting a tessellated CAD model that contains inconsistencies like cracks or intersections into a manifold and closed triangle mesh. Surface ...
Stephan Bischoff, Leif Kobbelt
SLIP
2009
ACM
15 years 9 months ago
From 3D circuit technologies and data structures to interconnect prediction
New technologies such as 3D integration are becoming a new force that is keeping Moore’s law in effect in today’s nano era. By adding a third dimension in current 2D circuits...
Robert Fischbach, Jens Lienig, Tilo Meister
104
Voted
SPAA
1990
ACM
15 years 6 months ago
Wait-Free Data Structures in the Asynchronous PRAM Model
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...
James Aspnes, Maurice Herlihy
ICNP
2007
IEEE
15 years 8 months ago
HEXA: Compact Data Structures for Faster Packet Processing
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley...