481 search results - page 7 / 97 » Martin's game: a lower bound for the number of sets |
CIAC
2006
Springer
14 years 8 days ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
IPPS
1998
IEEE
14 years 24 days ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
JCT
2007
13 years 8 months ago
2007
Let G be a simple graph with n vertices and m edges. Let ω(G) and α(G) be the numbers of vertices of the largest clique and the largest independent set in G, respectively. In th...
ICML
2003
IEEE
14 years 9 months ago
2003
IEEE
We present BL-WoLF, a framework for learnability in repeated zero-sum games where the cost of learning is measured by the losses the learning agent accrues (rather than the number...
PODS
2005
ACM
14 years 8 months ago
2005
ACM
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...