Sciweavers

140 search results - page 25 / 28
» ipl 2008
Sort
View
96
Voted
IPL
2007
96views more  IPL 2007»
14 years 10 months ago
On constructing an optimal consensus clustering from multiple clusterings
Computing a suitable measure of consensus among several clusterings on the same data is an important problem that arises in several areas such as computational biology and data mi...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao, Jie...
IPL
2008
97views more  IPL 2008»
14 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...
83
Voted
IPL
2007
94views more  IPL 2007»
14 years 9 months ago
A note on the Hadwiger number of circular arc graphs
Abstract. The intention of this note is to motivate the researchers to study Hadwiger’s conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G...
N. S. Narayanaswamy, Naveen Belkale, L. Sunil Chan...
78
Voted
IPL
2008
80views more  IPL 2008»
14 years 10 months ago
Path partitions of hypercubes
A path partition of a graph G is a set of vertex-disjoint paths that cover all vertices of G. Given a set P = {{ai, bi}}m i=1 of pairs of distinct vertices of the n-dimensional hy...
Petr Gregor, Tomás Dvorák
76
Voted
IPL
2008
114views more  IPL 2008»
14 years 10 months ago
The online Prize-Collecting Traveling Salesman Problem
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura