Sciweavers

4797 search results - page 167 / 960
» The complexity of partition tasks
Sort
View
GRAPHITE
2004
ACM
15 years 11 months ago
Robust, geometry-independent shadow volumes
A novel algorithm is presented that overcomes limitations of existing shadow volume algorithms when dealing with nonmanifold geometry and space partitioning. This simple algorithm...
Graham Aldridge, Eric Woods
WAW
2004
Springer
178views Algorithms» more  WAW 2004»
15 years 11 months ago
Communities Detection in Large Networks
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
Andrea Capocci, Vito Domenico Pietro Servedio, Gui...
DCC
1996
IEEE
15 years 10 months ago
Symmetric Trellis Coded Vector Quantization
We present here design techniques for trellis-coded vector quantizers with symmetric codebooks that facilitate lowcomplexity quantization as well as partitioning into equiprobable ...
Benjamin Belzer, John D. Villasenor
DICTA
2003
15 years 7 months ago
Edge-based Non-uniform Light Field Mapping
  In  this  paper,  an  image-based  method---non-uniform  light  field  mapping is proposed which combines edge-based  surface light field  partition  and non-...
Wendong Wang, Baocai Yin, Dehui Kong
CLUSTER
2001
IEEE
15 years 10 months ago
The Master-Slave Paradigm with Heterogeneous Processors
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a po...
Olivier Beaumont, Arnaud Legrand, Yves Robert