Sciweavers

562 search results - page 87 / 113
» Simple Randomized Algorithms for Closest Pair Problems
Sort
View
IVC
2002
132views more  IVC 2002»
13 years 8 months ago
Structure and motion estimation from apparent contours under circular motion
In this paper we address the problem of recovering structure and motion from the apparent contours of a smooth surface. Fixed image features under circular motion and their relati...
Kwan-Yee Kenneth Wong, Paulo R. S. Mendonça...
ICDM
2003
IEEE
240views Data Mining» more  ICDM 2003»
14 years 1 months ago
Clustering of Time Series Subsequences is Meaningless: Implications for Previous and Future Research
Given the recent explosion of interest in streaming data and online algorithms, clustering of time series subsequences, extracted via a sliding window, has received much attention...
Eamonn J. Keogh, Jessica Lin, Wagner Truppel
SPAA
2010
ACM
13 years 8 months ago
Scheduling to minimize power consumption using submodular functions
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
Erik D. Demaine, Morteza Zadimoghaddam
AINA
2005
IEEE
14 years 2 months ago
Maximum-Revenue Multicast Routing and Partial Admission Control for Multirate Multimedia Distribution
In this paper, we intend to solve the problem of maximum-revenue multicast routing with a partial admission control mechanism for multirate multimedia distribution. Specifically, ...
Hsu-Chen Cheng, Frank Yeong-Sung Lin
COMCOM
2007
103views more  COMCOM 2007»
13 years 8 months ago
Inter-autonomous system provisioning for end-to-end bandwidth guarantees
This paper addresses the issue of provisioning end-to-end bandwidth guarantees across multiple Autonomous Systems (ASes). We first review a cascaded model for negotiating and est...
Kin-Hon Ho, Michael P. Howarth, Ning Wang, George ...