977 search results - page 35 / 196 » Permuting Web Graphs |
108
click to vote
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
265
click to vote
ICCV
2011
IEEE
14 years 1 months ago
2011
IEEE
Complex human activities occurring in videos can be defined in terms of temporal configurations of primitive actions. Prior work typically hand-picks the primitives, their total...
104
click to vote
ISAAC
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. We study the two-layer planarization problems that have applications in Automatic Graph Drawing. We are searching for a two-layer planar subgraph of maximumweight in a gi...
120
click to vote
DMGT
2011
14 years 5 months ago
2011
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
123
click to vote
WWW
2001
ACM
16 years 2 months ago
2001
ACM
We propose a new Web search system that helps users clarify their information needs through interaction. The system represents the user's information needs using a query grap...