Sciweavers

5214 search results - page 256 / 1043
» The Online Specialization Problem
Sort
View
CVPR
2010
IEEE
15 years 12 months ago
Visual Tracking via Weakly Supervised Learning from Multiple Imperfect Oracles
Long-term persistent tracking in ever-changing environments is a challenging task, which often requires addressing difficult object appearance update problems. To solve them, most...
Bineng Zhong, Hongxun Yao, Sheng Chen, Xiaotong Yu...
APPROX
2005
Springer
105views Algorithms» more  APPROX 2005»
16 years 7 days ago
The Complexity of Making Unique Choices: Approximating 1-in- k SAT
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
Venkatesan Guruswami, Luca Trevisan
HICSS
2005
IEEE
101views Biometrics» more  HICSS 2005»
16 years 9 days ago
Attention and Communication: Decision Scenarios for Teleoperating Robots
The economics of robot manufacturing is driving us toward situations in which a single human operator will be expected to split attention across multiple semiautonomous vehicles, ...
Jeffrey V. Nickerson, Steven Skiena
ECOOP
2006
Springer
15 years 10 months ago
A Semantic Analysis of C++ Templates
Templates are a powerful but poorly understood feature of the C++ language. Their syntax resembles the parameterized classes of other languages (e.g., of Java). But because C++ sup...
Jeremy G. Siek, Walid Taha
SWAT
2004
Springer
136views Algorithms» more  SWAT 2004»
16 years 21 hour ago
The Relative Worst Order Ratio Applied to Seat Reservation
The seat reservation problem is the problem of assigning passengers to seats on a train with n seats and k stations enroute in an online manner. The performance of algorithms for t...
Joan Boyar, Paul Medvedev