19866 search results - page 345 / 3974 » Computing all factorizations in *** |
192
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
207
click to vote
ASSETS
2005
ACM
15 years 8 months ago
2005
ACM
We designed and evaluated an agent that recommends a pointing device gain for a given user, with mixed success. 12 participants with physical impairments used the Input Device Age...
133
click to vote
VLSID
2003
IEEE
16 years 7 months ago
2003
IEEE
In this paper, we provide an analytical framework to study the inter-cell and intra-cell bit-line coupling when it is superimposed with the ground bounce effect and show how those...
164
click to vote
ICALP
2005
Springer
16 years 9 days ago
2005
Springer
We reduce the approximation factor for Vertex Cover to 2 − Θ( 1√ log n ) (instead of the previous 2 − Θ(log log n log n ), obtained by Bar-Yehuda and Even [2], and by Moni...
163
click to vote
DAM
1999
15 years 6 months ago
1999
It is well known that on a line, a target point in unknown position can be found by walking a path at most 9 times as long as the distance from the start to the target point, in t...