Sciweavers

42230 search results - page 8427 / 8446
» Algorithms and Complexity Results for
Sort
View
PROMISE
2010
13 years 2 months ago
On the value of learning from defect dense components for software defect prediction
BACKGROUND: Defect predictors learned from static code measures can isolate code modules with a higher than usual probability of defects. AIMS: To improve those learners by focusi...
Hongyu Zhang, Adam Nelson, Tim Menzies
SIAMDM
2010
113views more  SIAMDM 2010»
13 years 2 months ago
The VPN Problem with Concave Costs
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
Samuel Fiorini, Gianpaolo Oriolo, Laura Sanit&agra...
SIAMDM
2010
194views more  SIAMDM 2010»
13 years 2 months ago
Combinatorics and Geometry of Finite and Infinite Squaregraphs
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
Hans-Jürgen Bandelt, Victor Chepoi, David Epp...
SIAMJO
2010
100views more  SIAMJO 2010»
13 years 2 months ago
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
Nathan Krislock, Henry Wolkowicz
SIAMSC
2010
136views more  SIAMSC 2010»
13 years 2 months ago
A Krylov Method for the Delay Eigenvalue Problem
Abstract. The Arnoldi method is currently a very popular algorithm to solve large-scale eigenvalue problems. The main goal of this paper is to generalize the Arnoldi method to the ...
Elias Jarlebring, Karl Meerbergen, Wim Michiels
« Prev « First page 8427 / 8446 Last » Next »