Sciweavers

5214 search results - page 72 / 1043
» The Online Specialization Problem
Sort
View
SIAMCO
2002
81views more  SIAMCO 2002»
13 years 7 months ago
Optimality Conditions for Irregular Inequality-Constrained Problems
Abstract. We consider feasible sets given by conic constraints, where the cone defining the constraints is convex with nonempty interior. We study the case where the feasible set i...
Alexey F. Izmailov, Mikhail V. Solodov
ICASSP
2011
IEEE
12 years 11 months ago
Secure video processing: Problems and challenges
Secure signal processing is an emerging technology to enable signal processing tasks in a secure and privacy-preserving fashion. It has attracted a great amount of research attent...
Wenjun Lu, Avinash L. Varna, Min Wu
FOCS
2005
IEEE
14 years 1 months ago
The Parking Permit Problem
We consider online problems where purchases have time durations which expire regardless of whether the purchase is used or not. The Parking Permit Problem is the natural analog of...
Adam Meyerson
ICMCS
2009
IEEE
170views Multimedia» more  ICMCS 2009»
13 years 5 months ago
Travel scrapbooks: Creating rich visual travel narratives
The convergence of the Internet and ubiquitous technologies offers an unprecedented level of convenience for information collection, accessing, and sharing through mobile devices ...
Vidya Setlur, Agathe Battestini, Xianghua Ding
TALG
2010
101views more  TALG 2010»
13 years 6 months ago
Reasoning about online algorithms with weighted automata
We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in...
Benjamin Aminof, Orna Kupferman, Robby Lampert