Sciweavers

170 search results - page 25 / 34
» Relevance Cuts: Localizing the Search
Sort
View
FOCS
2007
IEEE
14 years 1 months ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák
WEBI
2007
Springer
14 years 1 months ago
Experimental Bounds on the Usefulness of Personalized and Topic-Sensitive PageRank
PageRank is an algorithm used by several search engines to rank web documents according to their assumed relevance and popularity deduced from the Web’s link structure. PageRank...
Sinan Al-Saffar, Gregory L. Heileman
TKDE
2008
115views more  TKDE 2008»
13 years 7 months ago
A Niching Memetic Algorithm for Simultaneous Clustering and Feature Selection
Clustering is inherently a difficult task and is made even more difficult when the selection of relevant features is also an issue. In this paper, we propose an approach for simult...
Weiguo Sheng, Xiaohui Liu, Michael C. Fairhurst
SIGIR
2012
ACM
11 years 10 months ago
Content-based retrieval for heterogeneous domains: domain adaptation by relative aggregation points
We introduce the problem of domain adaptation for content-based retrieval and propose a domain adaptation method based on relative aggregation points (RAPs). Content-based retriev...
Makoto P. Kato, Hiroaki Ohshima, Katsumi Tanaka
EMMCVPR
2003
Springer
14 years 25 days ago
Asymptotic Characterization of Log-Likelihood Maximization Based Algorithms and Applications
The asymptotic distribution of estimates that are based on a sub-optimal search for the maximum of the log-likelihood function is considered. In particular, estimation schemes that...
Doron Blatt, Alfred O. Hero