759 search results - page 51 / 152 » Optimal Graph Search with Iterated Graph Cuts |
138
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
We introduce a stricter Web community definition to overcome boundary ambiguity of a Web community defined by Flake, Lawrence and Giles [2], and consider the problem of finding co...
177
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
147
click to vote
ICCAD
2005
IEEE
16 years 3 months ago
2005
IEEE
Clustering (or partitioning) is a crucial step between logic synthesis and physical design in the layout of a large scale design. A design verified at the logic synthesis level m...
160
click to vote
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
We regarded information retrieval as a graph search problem and proposed several novel dialog strategies that can recover from misrecognition through a spoken dialog that traverse...
196
click to vote
ENTCS
2007
15 years 6 months ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...