Sciweavers

794 search results - page 64 / 159
» Improved algorithms for orienteering and related problems
Sort
View
JCSS
2010
146views more  JCSS 2010»
13 years 7 months ago
Connected facility location 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...
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
13 years 11 months ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov
ITNG
2010
IEEE
14 years 2 months ago
A Fast and Stable Incremental Clustering Algorithm
— Clustering is a pivotal building block in many data mining applications and in machine learning in general. Most clustering algorithms in the literature pertain to off-line (or...
Steven Young, Itamar Arel, Thomas P. Karnowski, De...
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
14 years 19 days ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
AIPR
2005
IEEE
14 years 2 months ago
Hyperspectral Detection Algorithms: Operational, Next Generation, on the Horizon
Abstract—The multi-band target detection algorithms implemented in hyperspectral imaging systems represent perhaps the most successful example of image fusion. A core suite of su...
A. Schaum