4403 search results - page 540 / 881 » Galois Theory of Algorithms |
229
Voted
STOC
2004
ACM
16 years 7 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
219
click to vote
SODA
2010
ACM
16 years 5 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
190
click to vote
WSDM
2009
ACM
16 years 2 months ago
2009
ACM
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
204
click to vote
LCTRTS
2009
Springer
16 years 2 months ago
2009
Springer
Register allocation is often a two-phase approach: spilling of registers to memory, followed by coalescing of registers. Extreme liverange splitting (i.e. live-range splitting aft...
199
click to vote
NDSS
2008
IEEE
16 years 1 months ago
2008
IEEE
Automatic signature generation is necessary because there may often be little time between the discovery of a vulnerability, and exploits developed to target the vulnerability. Mu...