Sciweavers

159 search results - page 7 / 32
» Open Problems from CCCG 2008
Sort
View
IPM
2008
90views more  IPM 2008»
13 years 7 months ago
Local relational string and mutual matching for image retrieval
Exhibiting new features and likely related matching techniques to efficiently retrieve images from databases remains an open problem. This paper is first devoted to such a novel d...
Adel Hafiane, Bertrand Zavidovique
JUCS
2008
158views more  JUCS 2008»
13 years 7 months ago
A Linear Time Approximation Algorithm for Ruler Folding Problem
: A chain or n-link is a sequence of n links whose lengths are fixed and are joined together from their endpoints, free to turn about their endpoints, which act as joints. "Ru...
Ali Nourollah, Mohammadreza Razzazi
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
13 years 8 months ago
Approximating connected facility location problems via random facility sampling and core detouring
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Ro...
HAIS
2008
Springer
13 years 8 months ago
A WeVoS-CBR Approach to Oil Spill Problem
The hybrid intelligent system presented here, forecasts the presence or not of oil slicks in a certain area of the open sea after an oil spill using CaseBased Reasoning methodology...
Emilio Corchado, Bruno Baruque, Aitor Mata, Juan M...
TIT
2008
147views more  TIT 2008»
13 years 7 months ago
On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special cla...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...