Sciweavers

3874 search results - page 602 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
213
Voted
SIGMOD
2008
ACM
150views Database» more  SIGMOD 2008»
16 years 4 months ago
Ranking queries on uncertain data: a probabilistic threshold approach
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
Ming Hua, Jian Pei, Wenjie Zhang, Xuemin Lin
APPROX
2009
Springer
99views Algorithms» more  APPROX 2009»
15 years 10 months ago
Resource Minimization Job Scheduling
Abstract. Given a set J of jobs, where each job j is associated with release date rj, deadline dj and processing time pj, our goal is to schedule all jobs using the minimum possibl...
Julia Chuzhoy, Paolo Codenotti
ESA
2009
Springer
142views Algorithms» more  ESA 2009»
15 years 10 months ago
An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling
We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically...
Andreas Karrenbauer, Thomas Rothvoß
IROS
2008
IEEE
180views Robotics» more  IROS 2008»
15 years 10 months ago
Aligning point cloud views using persistent feature histograms
— In this paper we investigate the usage of persistent point feature histograms for the problem of aligning point cloud data views into a consistent global model. Given a collect...
Radu Bogdan Rusu, Nico Blodow, Zoltan Csaba Marton...
GLOBECOM
2007
IEEE
15 years 10 months ago
Optimizing P2P Streaming Throughput Under Peer Churning
Abstract— High-throughput P2P streaming relies on peer selection, the strategy a peer uses to select other peer(s) as its parent(s) of streaming. Although this problem has been t...
Yi Cui, Liang Dai, Yuan Xue