8917 search results - page 223 / 1784 » Abstraction in Algorithm Animation |
109
click to vote
IWOCA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
128
click to vote
ICCCN
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract—Many next-generation Internet architectures propose advanced packet processing functions in the data path of the network. Such “services” are typically performed on ...
AUSAI
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We present a novel algorithm called DBSC, which finds subspace clusters in numerical datasets based on the concept of ”dependency”. This algorithm employs a depth-...
127
click to vote
WAW
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
125
click to vote
WINE
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...