1087 search results - page 178 / 218 » Generation under Space Constraints |
143
click to vote
KDD
2009
ACM
16 years 4 months ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
128
click to vote
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
124
click to vote
JSAC
2006
15 years 4 months ago
2006
Abstract--We consider using traceroute-like end-to-end measurement to infer the underlay topology for a group of hosts. One major issue is the measurement cost. Given hosts in an a...
137
click to vote
AAAI
2000
15 years 5 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
136
click to vote
COLING
1996
15 years 5 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...