500 search results - page 66 / 100 » Approximation algorithms for maximum independent set of pseu... |
PVLDB
2010
15 years 5 days ago
2010
We propose the k-representative regret minimization query (k-regret) as an operation to support multi-criteria decision making. Like top-k, the k-regret query assumes that users h...
128
click to vote
ALENEX
2008
15 years 3 months ago
2008
The National Airspace System (NAS) is designed to accommodate a large number of flights over North America. For purposes of workload limitations for air traffic controllers, the a...
103
click to vote
COMPGEOM
2006
ACM
15 years 7 months ago
2006
ACM
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
124
click to vote
AAECC
2006
Springer
15 years 1 months ago
2006
Springer
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
117
Voted
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...