Sciweavers

794 search results - page 83 / 159
» Improved algorithms for orienteering and related problems
Sort
View
IPL
2010
114views more  IPL 2010»
13 years 7 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer
COLING
2010
13 years 4 months ago
FactRank: Random Walks on a Web of Facts
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...
Alpa Jain, Patrick Pantel
SODA
2003
ACM
132views Algorithms» more  SODA 2003»
13 years 10 months ago
Online learning in online auctions
We consider the problem of revenue maximization in online auctions, that is, auctions in which bids are received and dealt with one-by-one. In this note, we demonstrate that resul...
Avrim Blum, Vijay Kumar, Atri Rudra, Felix Wu
CDC
2009
IEEE
137views Control Systems» more  CDC 2009»
14 years 1 months ago
Kernel regression for travel time estimation via convex optimization
—We develop an algorithm aimed at estimating travel time on segments of a road network using a convex optimization framework. Sampled travel time from probe vehicles are assumed ...
Sebastien Blandin, Laurent El Ghaoui, Alexandre M....
CIIT
2004
13 years 10 months ago
Transliterated arabic name search
We address name search for transliterated Arabic given names. In previous work, we addressed similar problems with English and Arabic surnames. In each previous case, we used a va...
David Holmes, Samsum Kashfi, Syed Uzair Aqeel