Sciweavers

2100 search results - page 17 / 420
» Fundamentals of the problem
Sort
View
PODS
2006
ACM
108views Database» more  PODS 2006»
14 years 7 months ago
Deterministic k-set structure
A k-set structure over data streams is a bounded-space data structure that supports stream insertion and deletion operations and returns the set of (item, frequency) pairs in the s...
Sumit Ganguly, Anirban Majumder
STOC
2003
ACM
140views Algorithms» more  STOC 2003»
14 years 8 months ago
Approximation schemes for clustering problems
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...
EWCBR
2004
Springer
14 years 1 months ago
Facilitating CBR for Incompletely-Described Cases: Distance Metrics for Partial Problem Descriptions
A fundamental problem for case-based reasoning systems is how to select relevant prior cases. Numerous strategies have been developed for determining the similarity of prior cases,...
Steven Bogaerts, David B. Leake
DBPL
2007
Springer
158views Database» more  DBPL 2007»
13 years 11 months ago
Efficient Algorithms for the Tree Homeomorphism Problem
Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we deve...
Michaela Götz, Christoph Koch, Wim Martens
BMCBI
2005
152views more  BMCBI 2005»
13 years 7 months ago
An ant colony optimisation algorithm for the 2D and 3D hydrophobic polar protein folding problem
Background: The protein folding problem is a fundamental problems in computational molecular biology and biochemical physics. Various optimisation methods have been applied to for...
Alena Shmygelska, Holger H. Hoos