Sciweavers

92 search results - page 6 / 19
» isaac 2007
Sort
View
ISAAC
2007
Springer
89views Algorithms» more  ISAAC 2007»
14 years 4 months ago
Finding Popular Places
Widespread availability of location aware devices (such as GPS receivers) promotes capture of detailed movement trajectories of people, animals, vehicles and other moving objects, ...
Marc Benkert, Bojan Djordjevic, Joachim Gudmundsso...
ISAAC
2007
Springer
146views Algorithms» more  ISAAC 2007»
14 years 4 months ago
Bounded Tree-Width and CSP-Related Problems
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
Tommy Färnqvist, Peter Jonsson
ISAAC
2007
Springer
109views Algorithms» more  ISAAC 2007»
14 years 4 months ago
A Sub-cubic Time Algorithm for the k -Maximum Subarray Problem
We design a faster algorithm for the k-maximum sub-array problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we achieve O(n3 log ...
Sung Eun Bae, Tadao Takaoka
ISAAC
2007
Springer
111views Algorithms» more  ISAAC 2007»
14 years 4 months ago
Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
In an edge deletion problem one is asked to delete at most k edges from a given graph such that the resulting graph satisfies a certain property. In this work, we study four NP-co...
Jiong Guo
ISAAC
2007
Springer
100views Algorithms» more  ISAAC 2007»
14 years 4 months ago
Dynamic Distance Hereditary Graphs Using Split Decomposition
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
Emeric Gioan, Christophe Paul