18306 search results - page 282 / 3662 » Algorithmics in Exponential Time |
163
click to vote
COCO
2008
Springer
15 years 8 months ago
2008
Springer
We study the average-case hardness of the class NP against deterministic polynomial time algorithms. We prove that there exists some constant
177
click to vote
NOSSDAV
1995
Springer
15 years 10 months ago
1995
Springer
We define a class of Guaranteed Rate (GR) scheduling algorithms. The GR class includes Virtual Clock, Packet-byPacket Generalized Processor Sharing and Self Clocked Fair Queuing....
181
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Efficient algorithms are known for many operations on truncated power series (multiplication, powering, exponential, . . . ). Composition is a more complex task. We isolate a larg...
155
click to vote
DAM
2006
15 years 6 months ago
2006
Abstract. In this paper we present an algorithm for the problem of exhaustive equivalence-free generation of 3-connected matroids which are represented by a matrix over some finite...
183
click to vote
IJON
2006
15 years 6 months ago
2006
In this paper, it is shown that Independent Component Analysis (ICA) of sparse signals (sparse ICA) can be seen as a cluster-wise Principal Component Analysis (PCA). Consequently,...