Sciweavers

1026 search results - page 149 / 206
» On Finding Minimal w-cutset
Sort
View
CN
2006
73views more  CN 2006»
13 years 9 months ago
Rate-distortion based link state update
Finding paths that satisfy the performance requirements of applications according to the link state information in a network is known as the quality-of-service (QoS) routing probl...
Gang Cheng, Nirwan Ansari
ECCC
2006
109views more  ECCC 2006»
13 years 9 months ago
How to rank with few errors: A PTAS for Weighted Feedback Arc Set on Tournaments
Suppose you ran a chess tournament, everybody played everybody, and you wanted to use the results to rank everybody. Unless you were really lucky, the results would not be acyclic...
Claire Kenyon-Mathieu, Warren Schudy
JC
2008
96views more  JC 2008»
13 years 9 months ago
Adaptivity and computational complexity in the numerical solution of ODEs
In this paper we analyze the problem of adaptivity for one-step numerical methods for solving ODEs, both IVPs and BVPs, with a view to generating grids of minimal computational co...
Silvana Ilie, Gustaf Söderlind, Robert M. Cor...
JCO
2008
134views more  JCO 2008»
13 years 9 months ago
On minimum m -connected k -dominating set problem in unit disc graphs
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaod...
JMLR
2008
79views more  JMLR 2008»
13 years 9 months ago
Manifold Learning: The Price of Normalization
We analyze the performance of a class of manifold-learning algorithms that find their output by minimizing a quadratic form under some normalization constraints. This class consis...
Yair Goldberg, Alon Zakai, Dan Kushnir, Yaacov Rit...