994 search results - page 138 / 199 » Custom Computing Machines for the Set Covering Problem |
94
Voted
EACL
1993
ACL Anthology
15 years 1 months ago
1993
ACL Anthology
The first part of the paper develops a novel, sortally-based approach to the problem of aspectual composition. The account is argued to be superior on both empirical and computati...
107
click to vote
SIGMOD
2008
ACM
15 years 13 days ago
2008
ACM
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
111
Voted
FOCS
2002
IEEE
15 years 5 months ago
2002
IEEE
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...
108
Voted
CLUSTER
2005
IEEE
15 years 6 months ago
2005
IEEE
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...