Sciweavers

3913 search results - page 161 / 783
» complexity 2006
Sort
View
IPL
2002
118views more  IPL 2002»
15 years 3 months ago
Lower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...
LOBJET
2002
321views more  LOBJET 2002»
15 years 3 months ago
Understanding software evolution using a combination of software visualization and software metrics
Coping with huge amounts of data is one of the major problems in the context of software evolution. Current approaches reduce this complexity by filtering out irrelevant informatio...
Michele Lanza, Stéphane Ducasse
113
Voted
MP
1998
83views more  MP 1998»
15 years 3 months ago
A modified layered-step interior-point algorithm for linear programming
The layered-step interior-point algorithm was introduced by Vavasis and Ye. The algorithm accelerates the path following interior-point algorithm and its arithmetic complexity dep...
Nimrod Megiddo, Shinji Mizuno, Takashi Tsuchiya
118
Voted
NECO
2002
78views more  NECO 2002»
15 years 3 months ago
Local Overfitting Control via Leverages
We present a novel approach to dealing with overfitting in black-box models. It is based on the leverages of the samples, i.e. on the influence that each observation has on the pa...
Gaétan Monari, Gérard Dreyfus
IJHPCA
2010
117views more  IJHPCA 2010»
15 years 2 months ago
Grids and Clouds: Making Workflow Applications Work in Heterogeneous Distributed Environments
Scientific workflows are frequently being used to model complex phenomena, to analyze instrumental data, to tie together information from distributed sources, and to pursue other ...
Ewa Deelman