Sciweavers

71228 search results - page 14068 / 14246
» Algorithms
Sort
View
MST
2000
57views more  MST 2000»
15 years 6 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast
FSS
2002
84views more  FSS 2002»
15 years 6 months ago
A possibilistic approach to selecting portfolios with highest utility score
The mean-variance methodology for the portfolio selection problem, originally proposed by Markowitz, has been one of the most important research fields in modern finance. In this ...
Christer Carlsson, Robert Fullér, Pé...
PR
2000
102views more  PR 2000»
15 years 6 months ago
Bayesian face recognition
We propose a new technique for direct visual matching of images for the purposes of face recognition and image retrieval, using a probabilistic measure of similarity, based primar...
Baback Moghaddam, Tony Jebara, Alex Pentland
GIS
2002
ACM
15 years 6 months ago
Opening the black box: interactive hierarchical clustering for multivariate spatial patterns
Clustering is one of the most important tasks for geographic knowledge discovery. However, existing clustering methods have two severe drawbacks for this purpose. First, spatial c...
Diansheng Guo, Donna Peuquet, Mark Gahegan
GIS
2002
ACM
15 years 6 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...
« Prev « First page 14068 / 14246 Last » Next »