Sciweavers

1297 search results - page 5 / 260
» fews 2007
Sort
View
97
Voted
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
15 years 9 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy
55
Voted
LICS
2007
IEEE
15 years 3 months ago
Tractability and learnability arising from algebras with few subpowers
A k-edge operation ϕ on a finite set A is a k + 1-ary operation that satisfies the identities ϕ(x, x, y, . . . , y) ≈ ϕ(x, y, x, y, . . . , y) ≈ y and ϕ(y, y, y, x, y, ....
Pawel M. Idziak, Petar Markovic, Ralph McKenzie, M...
COMPSAC
2007
IEEE
15 years 3 months ago
Architecture-Based Software Reliability: Why Only a Few Parameters Matter?
Uncertainty analysis through sensitivity studies and quantification of the variance of the reliability estimate has become more common in architecture-based software reliability ...
Katerina Goseva-Popstojanova, Margaret Hamill
ISCC
2007
IEEE
15 years 3 months ago
MCP: Few Bits for Fairing and Small Queues in the Stable State
Abstract— Interactive and other delay-sensitive applications are interested in keeping end-to-end delays of their packets minimal. Unfortunately, congestion control offered by Tr...
Maxim Podlesny, Sergey Gorinsky
COMGEO
2007
ACM
14 years 9 months ago
Graph drawings with few slopes
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...
Vida Dujmovic, Matthew Suderman, David R. Wood