1067 search results - page 66 / 214 » Probabilistic regular graphs |
121
click to vote
CORR
2004
Springer
15 years 2 months ago
2004
Springer
We describe soft versions of the global cardinality constraint and the regular constraint, with efficient filtering algorithms maintaining domain consistency. For both constraints,...
159
click to vote
GLOBECOM
2007
IEEE
15 years 9 months ago
2007
IEEE
—Distributed denial-of-service attacks (DDoS) pose an immense threat to the Internet. The most studied solution is to let routers probabilistically mark packets with partial path...
131
click to vote
AI
2008
Springer
15 years 3 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
169
Voted
ICCV
2011
IEEE
14 years 3 months ago
2011
IEEE
This paper addresses the challenge of recognizing behavior of groups of individuals in unconstraint surveillance environments. As opposed to approaches that rely on agglomerative ...
134
click to vote
KDD
2009
ACM
16 years 3 months ago
2009
ACM
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...