Sciweavers

905 search results - page 107 / 181
» On the Complexity of uSPR Distance
Sort
View
PLDI
2005
ACM
15 years 3 months ago
Register allocation for software pipelined multi-dimensional loops
Software pipelining of a multi-dimensional loop is an important optimization that overlaps the execution of successive outermost loop iterations to explore instruction-level paral...
Hongbo Rong, Alban Douillet, Guang R. Gao
MST
2006
149views more  MST 2006»
14 years 9 months ago
Parameterized Intractability of Distinguishing Substring Selection
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
Jens Gramm, Jiong Guo, Rolf Niedermeier
TCS
2002
14 years 9 months ago
The chords' problem
The chords' problem is a variant of an old problem of computational geometry: given a set of points of n , one can easily build the multiset of the distances between the poi...
Alain Daurat, Yan Gérard, Maurice Nivat
KDD
2002
ACM
113views Data Mining» more  KDD 2002»
15 years 10 months ago
Scalable robust covariance and correlation estimates for data mining
Covariance and correlation estimates have important applications in data mining. In the presence of outliers, classical estimates of covariance and correlation matrices are not re...
Fatemah A. Alqallaf, Kjell P. Konis, R. Douglas Ma...
SIGMOD
2003
ACM
237views Database» more  SIGMOD 2003»
15 years 10 months ago
Qcluster: Relevance Feedback Using Adaptive Clustering for Content-Based Image Retrieval
The learning-enhanced relevance feedback has been one of the most active research areas in content-based image retrieval in recent years. However, few methods using the relevance ...
Deok-Hwan Kim, Chin-Wan Chung