1402 search results - page 146 / 281 » Searching Cycle-Disjoint Graphs |
NIPS
2001
14 years 11 months ago
2001
This paper presents an unsupervised learning algorithm that can derive the probabilistic dependence structure of parts of an object (a moving human body in our examples) automatic...
AIPS
2000
14 years 11 months ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
85
Voted
HEURISTICS
2006
14 years 10 months ago
2006
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
SIGIR
2002
ACM
14 years 9 months ago
2002
ACM
A novel method for simultaneous keyphrase extraction and generic text summarization is proposed by modeling text documents as weighted undirected and weighted bipartite graphs. Sp...
101
Voted
NETWORKS
2007
14 years 9 months ago
2007
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...