Sciweavers

6740 search results - page 486 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
156
Voted
COLING
2008
15 years 8 months ago
Exploiting Graph Structure for Accelerating the Calculation of Shortest Paths in Wordnets
This paper presents an approach for substantially reducing the time needed to calculate the shortest paths between all concepts in a wordnet. The algorithm exploits the unique &qu...
Holger Wunsch
145
Voted
CSJM
2006
76views more  CSJM 2006»
15 years 6 months ago
Graph Coloring using Peer-to-Peer Networks
The popularity of distributed file systems continues to grow in last years. The reasons they are preferred over traditional centralized systems include fault tolerance, availabili...
Adrian Iftene, Cornelius Croitoru
167
Voted
FAW
2007
Springer
110views Algorithms» more  FAW 2007»
16 years 1 months ago
Maximizing the Number of Independent Labels in the Plane
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
Kuen-Lin Yu, Chung-Shou Liao, Der-Tsai Lee
191
Voted
IGIS
1994
118views GIS» more  IGIS 1994»
15 years 11 months ago
Surface Modelling with Guaranteed Consistency - An Object-Based Approach
There have been many interpolation methods developed over the years, each with their own problems. One of the biggest limitations in many applications is the non-correspondence of...
Christopher M. Gold, Thomas Roos
232
Voted
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
16 years 4 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...