2004 search results - page 330 / 401 » Sampling from large graphs |
KBSE
1995
IEEE
14 years 1 months ago
1995
IEEE
Numerical design optimization algorithms are highly sensitive to the particular formulation of the optimization problems they are given. The formulation of the search space, the o...
JAIR
2006
13 years 10 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
SIGECOM
2011
ACM
13 years 24 days ago
2011
ACM
While social interactions are critical to understanding consumer behavior, the relationship between social and commerce networks has not been explored on a large scale. We analyze...
MLG
2007
Springer
14 years 4 months ago
2007
Springer
1 In web-related applications of image categorization, it is desirable to derive an interpretable classification rule with high accuracy. Using the bag-of-words representation and...
STOC
2010
ACM
13 years 10 months ago
2010
ACM
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...