Sciweavers

6943 search results - page 1002 / 1389
» Representations for evolutionary algorithms
Sort
View
ICDM
2003
IEEE
158views Data Mining» more  ICDM 2003»
16 years 3 days ago
Combining Multiple Weak Clusterings
A data set can be clustered in many ways depending on the clustering algorithm employed, parameter settings used and other factors. Can multiple clusterings be combined so that th...
Alexander P. Topchy, Anil K. Jain, William F. Punc...
ISCAS
2003
IEEE
104views Hardware» more  ISCAS 2003»
16 years 3 days ago
Real-time scheduling on scalable media stream delivery
Scalable streams provide a layered representation for transmitting media contents over a channel with packet losses and variable delay. In general, real-time streaming scalable me...
Kui Gao, Wen Gao, Simin He, Peng Gao, Yuan Zhang
SI3D
2003
ACM
16 years 2 days ago
Interactive visibility culling in complex environments using occlusion-switches
: We present occlusion-switches for interactive visibility culling in complex 3D environments. An occlusionswitch consists of two GPUs (graphics processing units) and each GPU is u...
Naga K. Govindaraju, Avneesh Sud, Sung-Eui Yoon, D...
COMPGEOM
2010
ACM
15 years 12 months ago
Geometric tomography with topological guarantees
We consider the problem of reconstructing a compact 3manifold (with boundary) embedded in R3 from its crosssections with a given set of cutting planes having arbitrary orientation...
Omid Amini, Jean-Daniel Boissonnat, Pooran Memari
GLVLSI
2002
IEEE
109views VLSI» more  GLVLSI 2002»
15 years 11 months ago
Minimizing resources in a repeating schedule for a split-node data-flow graph
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...
Timothy W. O'Neil, Edwin Hsing-Mean Sha
« Prev « First page 1002 / 1389 Last » Next »