Sciweavers

1298 search results - page 227 / 260
» The online set cover problem
Sort
View
106
Voted
ICNP
2002
IEEE
15 years 2 months ago
Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed multicast tunnels with failure backup. The multicast routing problem arises in many contexts such a...
Murali S. Kodialam, T. V. Lakshman
CDC
2009
IEEE
159views Control Systems» more  CDC 2009»
15 years 2 months ago
A distributed machine learning framework
Abstract— A distributed online learning framework for support vector machines (SVMs) is presented and analyzed. First, the generic binary classification problem is decomposed in...
Tansu Alpcan, Christian Bauckhage
PCM
2001
Springer
183views Multimedia» more  PCM 2001»
15 years 2 months ago
An Adaptive Index Structure for High-Dimensional Similarity Search
A practical method for creating a high dimensional index structure that adapts to the data distribution and scales well with the database size, is presented. Typical media descrip...
Peng Wu, B. S. Manjunath, Shivkumar Chandrasekaran
70
Voted
ECCV
2010
Springer
15 years 2 months ago
Efficiently Scaling Up Video Annotation with Crowdsourced Marketplaces
Accurately annotating entities in video is labor intensive and expensive. As the quantity of online video grows, traditional solutions to this task are unable to scale to meet the ...
ACCV
2007
Springer
15 years 1 months ago
Feature Management for Efficient Camera Tracking
In dynamic scenes with occluding objects many features need to be tracked for a robust real-time camera pose estimation. An open problem is that tracking too many features has a ne...
Harald Wuest, Alain Pagani, Didier Stricker