Sciweavers

1161 search results - page 75 / 233
» Approximation schemes for clustering problems
Sort
View
ICAS
2005
IEEE
90views Robotics» more  ICAS 2005»
15 years 5 months ago
A TCP-Friendly Stateless AQM Scheme for Fair Bandwidth Allocation
Queue management, bandwidth share, and congestion control are very important to both robustness and fairness of the Internet. In this article, we investigate the problem of provid...
Cheng-Yuan Hoa, Yi-Cheng Chan, Yaw-Chung Chen
CORR
2010
Springer
142views Education» more  CORR 2010»
14 years 12 months ago
Integrality Gaps of Linear and Semi-definite Programming Relaxations for Knapsack
Recent years have seen an explosion of interest in lift and project methods, such as those proposed by Lov
Anna R. Karlin, Claire Mathieu, C. Thach Nguyen
TKDE
2012
270views Formal Methods» more  TKDE 2012»
13 years 2 months ago
Low-Rank Kernel Matrix Factorization for Large-Scale Evolutionary Clustering
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
Lijun Wang, Manjeet Rege, Ming Dong, Yongsheng Din...
IEEEMSP
2002
IEEE
15 years 4 months ago
An optimal shape encoding scheme using skeleton decomposition
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
Haohong Wang, Guido M. Schuster, Aggelos K. Katsag...
JCDL
2006
ACM
161views Education» more  JCDL 2006»
15 years 5 months ago
Learning metadata from the evidence in an on-line citation matching scheme
Citation matching, or the automatic grouping of bibliographic references that refer to the same document, is a data management problem faced by automatic digital libraries for sci...
Isaac G. Councill, Huajing Li, Ziming Zhuang, Sand...