Sciweavers

2566 search results - page 14 / 514
» The Online Median Problem
Sort
View
BMVC
1998
13 years 9 months ago
Effective Corner Matching
This paper tackles the problem of obtaining a good initial set of corner matches between two images without resorting to any constraints from motion or structure models. Several d...
Paul Smith, D. Sinclair, Roberto Cipolla, K. Wood
STOC
2003
ACM
141views Algorithms» more  STOC 2003»
14 years 8 months ago
Better streaming algorithms for clustering problems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
Moses Charikar, Liadan O'Callaghan, Rina Panigrahy
CORR
2010
Springer
83views Education» more  CORR 2010»
13 years 7 months ago
Investigating the Performance of an Adiabatic Quantum Optimization Processor
We calculate median adiabatic times (in seconds) of a specific superconducting adiabatic quantum processor for an NP-hard Ising spin glass instance class with up to N = 128 binary ...
Geordie Rose, Kamran Karimi, Neil G. Dickson, Fira...
ICNSC
2008
IEEE
14 years 2 months ago
Facility Location Optimization via Multi-Agent Robotic Systems
— A facility location problem deals with locating the best place for a group of facilities, among distinct demand points, minimizing a certain locational optimization function. I...
Miad Moarref, Hassan Sayyadi
ICML
2006
IEEE
14 years 8 months ago
Learning algorithms for online principal-agent problems (and selling goods online)
In a principal-agent problem, a principal seeks to motivate an agent to take a certain action beneficial to the principal, while spending as little as possible on the reward. This...
Vincent Conitzer, Nikesh Garera