Sciweavers

75 search results - page 12 / 15
» Triangle Fixing Algorithms for the Metric Nearness Problem
Sort
View
PDCAT
2005
Springer
14 years 2 months ago
Approximating Spanning Trees with Inner Nodes Cost
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Hai...
DAS
2010
Springer
13 years 10 months ago
Overlapped text segmentation using Markov random field and aggregation
Separating machine printed text and handwriting from overlapping text is a challenging problem in the document analysis field and no reliable algorithms have been developed thus f...
Xujun Peng, Srirangaraj Setlur, Venu Govindaraju, ...
FAST
2007
13 years 10 months ago
AMP: Adaptive Multi-stream Prefetching in a Shared Cache
Abstract— Prefetching is a widely used technique in modern data storage systems. We study the most widely used class of prefetching algorithms known as sequential prefetching. Th...
Binny S. Gill, Luis Angel D. Bathen
JPDC
2007
138views more  JPDC 2007»
13 years 8 months ago
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
Erion Plaku, Lydia E. Kavraki
TIP
2010
161views more  TIP 2010»
13 years 3 months ago
Automatic Parameter Selection for Denoising Algorithms Using a No-Reference Measure of Image Content
Across the field of inverse problems in image and video processing, nearly all algorithms have various parameters which need to be set in order to yield good results. In practice, ...
Xiang Zhu, Peyman Milanfar