Sciweavers

5580 search results - page 386 / 1116
» Randomized priority algorithms
Sort
View
CN
2000
92views more  CN 2000»
15 years 7 months ago
What is this page known for? Computing Web page reputations
The textual content of the Web enriched with the hyperlink structure surrounding it can be a useful source of information for querying and searching. This paper presents a search ...
Davood Rafiei, Alberto O. Mendelzon
177
Voted
JMLR
2010
109views more  JMLR 2010»
15 years 2 months ago
Matrix Completion from Noisy Entries
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of app...
Raghunandan H. Keshavan, Andrea Montanari, Sewoong...
191
Voted
IBPRIA
2007
Springer
16 years 1 months ago
Estimation of Multiple Objects at Unknown Locations with Active Contours
Abstract. This paper presents an algorithm for the estimation of multiple regions with unknown shapes and positions using multiple active contour models (ACM’s). The algorithm or...
Margarida Silveira, Jorge S. Marques
176
Voted
SODA
2004
ACM
146views Algorithms» more  SODA 2004»
15 years 8 months ago
Approximating the two-level facility location problem via a quasi-greedy approach
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
Jiawei Zhang
ICML
2005
IEEE
16 years 8 months ago
Coarticulation: an approach for generating concurrent plans in Markov decision processes
We study an approach for performing concurrent activities in Markov decision processes (MDPs) based on the coarticulation framework. We assume that the agent has multiple degrees ...
Khashayar Rohanimanesh, Sridhar Mahadevan