Sciweavers

336 search results - page 45 / 68
» Analytic Cut Trees
Sort
View
WWW
2008
ACM
14 years 8 months ago
A graph-theoretic approach to webpage segmentation
We consider the problem of segmenting a webpage into visually and semantically cohesive pieces. Our approach is based on formulating an appropriate optimization problem on weighte...
Deepayan Chakrabarti, Ravi Kumar, Kunal Punera
WWW
2005
ACM
14 years 8 months ago
Partitioning of Web graphs by community topology
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...
Hidehiko Ino, Mineichi Kudo, Atsuyoshi Nakamura
EUROGRAPHICS
2010
Eurographics
14 years 3 months ago
Bidirectional Search for Interactive Motion Synthesis
We present an approach to improve the search efficiency for near-optimal motion synthesis using motion graphs. An optimal or near-optimal path through a motion graph often leads ...
Wan-Yen Lo and Matthias Zwicker
ACG
2009
Springer
14 years 2 months ago
Evaluation Function Based Monte-Carlo LOA
Recently, Monte-Carlo Tree Search (MCTS) has advanced the field of computer Go substantially. In the game of Lines of Action (LOA), which has been dominated in the past by αβ, M...
Mark H. M. Winands, Yngvi Björnsson
IWPEC
2009
Springer
14 years 2 months ago
Boolean-Width of Graphs
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...