Sciweavers

16404 search results - page 871 / 3281
» A set coverage problem
Sort
View
IJCAI
1997
15 years 9 months ago
Automatic Generation of Heuristics for Scheduling
This paper presents a technique, called GENH, that automatically generates search heuristics for scheduling problems. The impetus for developing this technique is the growing cons...
Robert A. Morris, John L. Bresina, Stuart M. Rodge...
SIGMETRICS
2010
ACM
181views Hardware» more  SIGMETRICS 2010»
15 years 7 months ago
A unified modeling framework for distributed resource allocation of general fork and join processing networks
This paper addresses the problem of distributed resource allocation in general fork and join processing networks. The problem is motivated by the complicated processing requiremen...
Haiquan (Chuck) Zhao, Cathy H. Xia, Zhen Liu, Dona...
ICDE
2010
IEEE
282views Database» more  ICDE 2010»
16 years 7 months ago
Quantile-Based KNN Over Multi-Valued Objects
K Nearest Neighbor search has many applications including data mining, multi-media, image processing, and monitoring moving objects. In this paper, we study the problem of KNN over...
Wenjie Zhang, Xuemin Lin, Muhammad Aamir Cheema, Y...
IJON
2008
158views more  IJON 2008»
15 years 7 months ago
Blind separation of convolutive image mixtures
Convolutive mixtures of images are common in photography of semi-reflections. They also occur in microscopy and tomography. Their formation process involves focusing on an object ...
Sarit Shwartz, Yoav Y. Schechner, Michael Zibulevs...
PRL
2006
98views more  PRL 2006»
15 years 7 months ago
Data complexity assessment in undersampled classification of high-dimensional biomedical data
Regularized linear classifiers have been successfully applied in undersampled, i.e. small sample size/high dimensionality biomedical classification problems. Additionally, a desig...
Richard Baumgartner, Ray L. Somorjai