Sciweavers

396 search results - page 66 / 80
» Crossing Numbers
Sort
View
CLEF
2010
Springer
13 years 8 months ago
HITS and Misses: Combining BM25 with HITS for Expert Search
Abstract. This paper describes the participation of Dublin City University in the CriES (Cross-Lingual Expert Search) pilot challenge. To realize expert search, we combine traditio...
Johannes Leveling, Gareth J. F. Jones
GD
2008
Springer
13 years 8 months ago
Cyclic Leveling of Directed Graphs
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...
Christian Bachmaier, Franz-Josef Brandenburg, Wolf...
ALGORITHMICA
2010
127views more  ALGORITHMICA 2010»
13 years 7 months ago
An Algorithm for Minimum Cost Arc-Connectivity Orientations
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
Satoru Iwata, Yusuke Kobayashi
GIS
2006
ACM
13 years 7 months ago
Qualitative polyline similarity testing with applications to query-by-sketch, indexing and classification
We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cross formalism. To determine the degree of similarity between two polylines, the...
Bart Kuijpers, Bart Moelans, Nico Van de Weghe
JAIR
2007
106views more  JAIR 2007»
13 years 7 months ago
Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a novel constructive search technique that performs a series of resource-limited tree searches where each search begins...
J. Christopher Beck