Sciweavers

1964 search results - page 241 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
STACS
2007
Springer
14 years 2 months ago
Testing Convexity Properties of Tree Colorings
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
Eldar Fischer, Orly Yahalom
WSCG
2004
190views more  WSCG 2004»
13 years 9 months ago
Scalable Compression and Rendering of Textured Terrain Data
Several sophisticated methods are available for efficient rendering of out-of-core terrain data sets. For huge data sets the use of preprocessed tiles has proven to be more effici...
Roland Wahl, Manuel Massing, Patrick Degener, Mich...
ICPR
2004
IEEE
14 years 9 months ago
Precise Estimation of High-Dimensional Distribution and Its Application to Face Recognition
In statistical pattern recognition, it is important to estimate true distribution of patterns precisely to obtain high recognition accuracy. Normal mixtures are sometimes used for...
Shinichiro Omachi, Fang Sun, Hirotomo Aso
GECCO
2004
Springer
244views Optimization» more  GECCO 2004»
14 years 1 months ago
Using Clustering Techniques to Improve the Performance of a Multi-objective Particle Swarm Optimizer
In this paper, we present an extension of the heuristic called “particle swarm optimization” (PSO) that is able to deal with multiobjective optimization problems. Our approach ...
Gregorio Toscano Pulido, Carlos A. Coello Coello
INTERNET
2006
157views more  INTERNET 2006»
13 years 8 months ago
Distributed Data Mining in Peer-to-Peer Networks
Distributed data mining deals with the problem of data analysis in environments with distributed data, computing nodes, and users. Peer-to-peer computing is emerging as a new dist...
Souptik Datta, Kanishka Bhaduri, Chris Giannella, ...