Sciweavers

1933 search results - page 56 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
ICASSP
2007
IEEE
14 years 3 months ago
Integrating Relevance Feedback in Boosting for Content-Based Image Retrieval
Many content-based image retrieval applications suffer from small sample set and high dimensionality problems. Relevance feedback is often used to alleviate those problems. In thi...
Jie Yu, Yijuan Lu, Yuning Xu, Nicu Sebe, Qi Tian
ECRTS
1999
IEEE
14 years 1 months ago
The case for feedback control real-time scheduling
Despite the significant body of results in real-time scheduling, many real world problems are not easily supported. While algorithms such as Earliest Deadline First, Rate Monotoni...
Jack A. Stankovic, Chenyang Lu, Sang Hyuk Son, Gan...
SIGIR
2005
ACM
14 years 2 months ago
Assessing the term independence assumption in blind relevance feedback
When applying blind relevance feedback for ad hoc document retrieval, is it possible to identify, a priori, the set of query terms that will most improve retrieval performance? Ca...
Jimmy J. Lin, G. Craig Murray
ICIP
2008
IEEE
14 years 3 months ago
A fast level set algorithm for shape-based segmentation with multiple selective priors
This paper addresses the shape-based segmentation problem using level sets. In particular, we propose a fast algorithm to solve the piece-wise constant Chan-Vese segmentation mode...
Rachid Fahmi, Aly A. Farag
JAL
2006
175views more  JAL 2006»
13 years 8 months ago
Approximations for minimum and min-max vehicle routing problems
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
Esther M. Arkin, Refael Hassin, Asaf Levin