Sciweavers

4110 search results - page 142 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
136
Voted
ICMCS
2007
IEEE
288views Multimedia» more  ICMCS 2007»
15 years 8 months ago
Network Lifetime Maximization in Wireless Visual Sensor Networks using a Distributed Algorithm
Network lifetime maximization is a critical issue in wireless sensor networks since each sensor has a limited energy supply. Different from conventional sensors, video sensors com...
Yifeng He, Ivan Lee, Ling Guan
155
Voted
NETWORKING
2008
15 years 6 months ago
A Distributed Algorithm for Overlay Backbone Multicast Routing in Content Delivery Networks
Abstract. To support large-scale live Internet broadcasting services efficiently in content delivery networks (CDNs), it is essential to exploit peer-to-peer capabilities among end...
Jun Guo, Sanjay Jha
136
Voted
NIPS
2004
15 years 5 months ago
Exponentiated Gradient Algorithms for Large-margin Structured Classification
We consider the problem of structured classification, where the task is to predict a label y from an input x, and y has meaningful internal structure. Our framework includes super...
Peter L. Bartlett, Michael Collins, Benjamin Taska...
CGF
2006
98views more  CGF 2006»
15 years 4 months ago
An Improved Physically-Based Soft Shadow Volume Algorithm
We identify and analyze several performance problems in a state-of-the-art physically-based soft shadow volume algorithm, and present an improved method that alleviates these prob...
Jaakko Lehtinen, Samuli Laine, Timo Aila
CP
2008
Springer
15 years 6 months ago
Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
Alexandre Goldsztejn, Yahia Lebbah, Claude Michel,...