Sciweavers

1209 search results - page 78 / 242
» On the Resilience of Classes to Change
Sort
View
JDA
2010
88views more  JDA 2010»
15 years 4 months ago
Greedy colorings for the binary paintshop problem
Cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color chan...
Hadis Amini, Frédéric Meunier, H&eac...
ICCV
2009
IEEE
15 years 4 months ago
Realtime background subtraction from dynamic scenes
This paper examines the problem of moving object detection. More precisely, it addresses the difficult scenarios where background scene textures in the video might change over tim...
Li Cheng, Minglun Gong
FOCS
2008
IEEE
16 years 23 days ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...
MOBIHOC
2002
ACM
16 years 5 months ago
Path set selection in mobile ad hoc networks
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
Emin Gün Sirer, Panagiotis Papadimitratos, Zy...
INFOCOM
2009
IEEE
16 years 29 days ago
Rateless Coding with Feedback
The erasure resilience of rateless codes, such as Luby-Transform (LT) codes, makes them particularly suitable to a wide variety of loss-prone wireless and sensor network applicati...
Andrew Hagedorn, Sachin Agarwal, David Starobinski...