2079 search results - page 144 / 416 » Universality of random graphs |
149
click to vote
FOCS
2008
IEEE
15 years 5 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
134
click to vote
IAJIT
2008
15 years 4 months ago
2008
: This paper presents a graph-coloring-based algorithm for the exam scheduling application, with the objective of achieving fairness, accuracy, and optimal exam time period. Throug...
212
click to vote
CVPR
2009
IEEE
16 years 12 months ago
2009
IEEE
Analyzing videos of human activities involves not only
recognizing actions (typically based on their appearances),
but also determining the story/plot of the video. The storyline...
153
click to vote
STOC
1990
ACM
15 years 8 months ago
1990
ACM
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
139
click to vote
KDD
2003
ACM
16 years 5 months ago
2003
ACM
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...