5169 search results - page 139 / 1034 » Locality approximation using time |
120
Voted
CSDA
2004
15 years 4 months ago
2004
Using a B-spline representation for splines with knots seen as free variables, the approximation to data by splines improves greatly. The main limitations are the presence of too ...
129
click to vote
SDM
2007
SIAM
15 years 6 months ago
2007
SIAM
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
167
click to vote
WAOA
2005
Springer
15 years 10 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
159
click to vote
WAW
2007
Springer
15 years 11 months ago
2007
Springer
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
173
click to vote
APPROX
2005
Springer
15 years 10 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...