Sciweavers

1628 search results - page 231 / 326
» Partitioning Sets with Genetic Algorithms
Sort
View
MFCS
2005
Springer
14 years 3 months ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
CCCG
2010
13 years 11 months ago
An optimal solution for dynamic polar diagram
The Polar Diagram [1] of a set of points (i.e. sites) is a partition of the plane. It is a locus approach for problems processing angles. Also, Dynamic Polar Diagram problem is a ...
Ebrahim Ehsanfar, Bahram Sadeghi Bigham, Najmeh Ma...
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
13 years 11 months ago
Clustering from Constraint Graphs
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...
Ari Freund, Dan Pelleg, Yossi Richter
TVLSI
1998
124views more  TVLSI 1998»
13 years 9 months ago
Computing support-minimal subfunctions during functional decomposition
Abstract— The growing popularity of look-up table (LUT)based field programmable gate arrays (FPGA’s) has renewed the interest in functional or Roth–Karp decomposition techni...
Christian Legl, Bernd Wurth, Klaus Eckl
IPL
2008
97views more  IPL 2008»
13 years 9 months ago
Dynamic polar diagram
The Polar Diagram [1] of a set of points (i.e. sites) is a partition of the plane. It is a locus approach for problems processing angles. Also, Dynamic Polar Diagram problem is a ...
Bahram Sadeghi Bigham, Ali Mohades, Lidia M. Orteg...