Sciweavers

15254 search results - page 19 / 3051
» A k
Sort
View
JODS
2006
135views Data Mining» more  JODS 2006»
13 years 9 months ago
Managing Uncertainty in Schema Matching with Top-K Schema Mappings
In this paper, we propose to extend current practice in schema matching with the simultaneous use of top-K schema mappings rather than a single best mapping. This is a natural ext...
Avigdor Gal
DMIN
2009
195views Data Mining» more  DMIN 2009»
13 years 7 months ago
Improved k-NN Algorithm for Text Classification
- Over the last twenty years, text classification has become one of the key techniques for organizing electronic information such as text and web documents. The k-Nearest Neighbor ...
Muhammed Miah
STACS
2007
Springer
14 years 3 months ago
Small Space Representations for Metric Min-Sum k -Clustering and Their Applications
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
Artur Czumaj, Christian Sohler
WAOA
2005
Springer
177views Algorithms» more  WAOA 2005»
14 years 3 months ago
Approximation and Complexity of k-Splittable Flows
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
Ronald Koch, Martin Skutella, Ines Spenke
EDBT
2010
ACM
185views Database» more  EDBT 2010»
13 years 11 months ago
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
Bin Yang 0002, Hua Lu, Christian S. Jensen