Sciweavers

418 search results - page 49 / 84
» Many Happy Returns
Sort
View
ECIR
2008
Springer
13 years 10 months ago
Exploiting Locality of Wikipedia Links in Entity Ranking
Abstract. Information retrieval from web and XML document collections is ever more focused on returning entities instead of web pages or XML elements. There are many research field...
Jovan Pehcevski, Anne-Marie Vercoustre, James A. T...
NSDI
2010
13 years 10 months ago
MapReduce Online
MapReduce is a popular framework for data-intensive distributed computing of batch jobs. To simplify fault tolerance, many implementations of MapReduce materialize the entire outp...
Tyson Condie, Neil Conway, Peter Alvaro, Joseph M....
SDM
2010
SIAM
146views Data Mining» more  SDM 2010»
13 years 10 months ago
Evaluating Query Result Significance in Databases via Randomizations
Many sorts of structured data are commonly stored in a multi-relational format of interrelated tables. Under this relational model, exploratory data analysis can be done by using ...
Markus Ojala, Gemma C. Garriga, Aristides Gionis, ...
NIPS
2007
13 years 10 months ago
Selecting Observations against Adversarial Objectives
In many applications, one has to actively select among a set of expensive observations before making an informed decision. Often, we want to select observations which perform well...
Andreas Krause, H. Brendan McMahan, Carlos Guestri...
IJCAI
2001
13 years 10 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz