7150 search results - page 1299 / 1430 » An Approximation Algorithm for Approximation Rank |
151
click to vote
INFOCOM
2000
IEEE
15 years 10 months ago
2000
IEEE
— In broadcast disk systems, information is broadcasted in a shared medium. When a client needs an item from the disk, it waits until that item is broadcasted. The fundamental al...
175
click to vote
STOC
2000
ACM
15 years 10 months ago
2000
ACM
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
173
click to vote
CIAC
2000
Springer
15 years 10 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
179
click to vote
INFOCOM
1999
IEEE
15 years 10 months ago
1999
IEEE
-- The Internet is facing two problems simultaneously: there is a need for a faster switching/routing infrastructure, and a need to introduce guaranteed qualities of service (QoS)....
160
click to vote
STOC
1994
ACM
15 years 10 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...