Sciweavers

2272 search results - page 95 / 455
» Capture Complexity by Partition
Sort
View
GRAPHITE
2004
ACM
15 years 3 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 3 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...
109
Voted
DCC
1996
IEEE
15 years 2 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
14 years 11 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
AAAI
2011
13 years 10 months ago
Complete Information Pursuit Evasion in Polygonal Environments
Suppose an unpredictable evader is free to move around in a polygonal environment of arbitrary complexity that is under full camera surveillance. How many pursuers, each with the ...
Kyle Klein, Subhash Suri