3267 search results - page 588 / 654 » Generalized quasirandom graphs |
120
Voted
KDD
2008
ACM
16 years 1 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
127
Voted
PEPM
2010
ACM
15 years 10 months ago
2010
ACM
A method for context-sensitive analysis of binaries that may have obfuscated procedure call and return operations is presented. Such binaries may use operators to directly manipul...
116
Voted
FOCS
2005
IEEE
15 years 6 months ago
2005
IEEE
We consider the problem of embedding finite metrics with slack: we seek to produce embeddings with small dimension and distortion while allowing a (small) constant fraction of al...
128
click to vote
SIGECOM
2010
ACM
15 years 6 months ago
2010
ACM
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
143
Voted
SPAA
1999
ACM
15 years 5 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...