2254 search results - page 125 / 451 » Computing the minimal covering set |
117
click to vote
FOCM
2011
14 years 4 months ago
2011
This paper considers large-scale simulations of wave propagation phenomena. We argue that it is possible to accurately compute a wavefield by decomposing it onto a largely incomp...
188
click to vote
VLDB
2008
ACM
16 years 1 months ago
2008
ACM
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
115
click to vote
PPOPP
2005
ACM
15 years 6 months ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
STOC
2006
ACM
16 years 1 months ago
2006
ACM
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
93
Voted
ILP
2003
Springer
15 years 6 months ago
2003
Springer
In the case of concept learning from positive and negative examples, it is rarely possible to find a unique discriminating conjunctive rule; in most cases, a disjunctive descripti...