2957 search results - page 205 / 592 » The Complexity of Polynomial-Time Approximation |
135
click to vote
IWSSD
2000
IEEE
15 years 10 months ago
2000
IEEE
Modern software is often constructed using "spiral specification"; i.e. the specification is a dynamic document that is altered by experience with the current version of...
161
click to vote
CIAC
2010
Springer
15 years 10 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
166
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
171
click to vote
DAGSTUHL
2004
15 years 8 months ago
2004
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
178
click to vote
JMLR
2006
15 years 6 months ago
2006
Support vector machines (SVMs), though accurate, are not preferred in applications requiring great classification speed, due to the number of support vectors being large. To overc...