2137 search results - page 336 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
165
Voted
IPPS
2010
IEEE
15 years 14 days ago
2010
IEEE
Abstract--The increasing availability of multi-core and multiprocessor architectures provides new opportunities for improving the performance of many computer simulations. Markov C...
117
click to vote
WAW
2007
Springer
15 years 8 months ago
2007
Springer
Motivated by the problem of detecting link-spam, we consider the following graph-theoretic primitive: Given a webgraph G, a vertex v in G, and a parameter δ ∈ (0, 1), compute th...
143
click to vote
ISAAC
2004
Springer
15 years 8 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
145
Voted
PG
2000
IEEE
15 years 7 months ago
2000
IEEE
This paper presents solutions to the feature correspondence and feature interpolation problems in image morphing. The user specifies the correspondence between the source and the...
138
Voted
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...