Sciweavers

951 search results - page 123 / 191
» On the Computation of Correctly-Rounded Sums
Sort
View
CSIE
2009
IEEE
15 years 11 months ago
Evaluating Clustering Algorithms: Cluster Quality and Feature Selection in Content-Based Image Clustering
The paper presents an evaluation of four clustering algorithms: k-means, average linkage, complete linkage, and Ward’s method, with the latter three being different hierarchical...
Mesfin Sileshi, Björn Gambäck
WADS
2009
Springer
243views Algorithms» more  WADS 2009»
15 years 11 months ago
Resolving Loads with Positive Interior Stresses
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
Günter Rote, André Schulz
CIE
2009
Springer
15 years 11 months ago
Cutting Planes and the Parameter Cutwidth
We introduce the parameter cutwidth for the Cutting Planes (CP) system of Gomory and Chv´atal. We provide linear lower bounds on cutwidth for two simple polytopes. Considering CP ...
Stefan S. Dantchev, Barnaby Martin
IWPEC
2009
Springer
15 years 10 months ago
Boolean-Width of Graphs
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
TAMC
2009
Springer
15 years 10 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens