Sciweavers

1402 search results - page 23 / 281
» Searching Cycle-Disjoint Graphs
Sort
View
SIGIR
2010
ACM
13 years 9 months ago
Exploiting click-through data for entity retrieval
We present an approach for answering Entity Retrieval queries using click-through information in query log data from a commercial Web search engine. We compare results using click...
Bodo Billerbeck, Gianluca Demartini, Claudiu S. Fi...
IBIS
2006
109views more  IBIS 2006»
13 years 9 months ago
Formulation Schema Matching Problem for Combinatorial Optimization Problem
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
Zhi Zhang, Pengfei Shi, Haoyang Che, Yong Sun, Jun...
GECCO
2008
Springer
140views Optimization» more  GECCO 2008»
13 years 10 months ago
A bivariate probabilistic model-building genetic algorithm for graph bipartitioning
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
Dirk Thierens
SIAMDM
2008
84views more  SIAMDM 2008»
13 years 9 months ago
Long Local Searches for Maximal Bipartite Subgraphs
Given a partition of the vertices of a graph into two sets, a flip is a move of a vertex from its own set to the other, under the condition that it has more incident edges to vert...
Hemanshu Kaul, Douglas B. West
CCCG
2010
13 years 11 months ago
Computing straight skeletons of planar straight-line graphs based on motorcycle graphs
We present a simple algorithm for computing straight skeletons of planar straight-line graphs. We exploit the relation between motorcycle graphs and straight skeletons, and introd...
Stefan Huber, Martin Held