Sciweavers

33 search results - page 5 / 7
» A Simple Streaming Algorithm for Minimum Enclosing Balls
Sort
View
AIPS
2003
13 years 8 months ago
Optimal Rectangle Packing: Initial Results
Given a set of rectangles with fixed orientations, we want to find an enclosing rectangle of minimum area that contains them all with no overlap. Many simple scheduling tasks ca...
Richard E. Korf
ICML
2010
IEEE
13 years 8 months ago
Unsupervised Risk Stratification in Clinical Datasets: Identifying Patients at Risk of Rare Outcomes
Most existing algorithms for clinical risk stratification rely on labeled training data. Collecting this data is challenging for clinical conditions where only a small percentage ...
Zeeshan Syed, Ilan Rubinfeld
CIKM
2010
Springer
13 years 6 months ago
A method for discovering components of human rituals from streams of sensor data
This paper describes an algorithm for determining if an event occurs persistently within an interval where the interval is periodic but the event is not. The goal of the algorithm...
Athanasios Bamis, Jia Fang, Andreas Savvides
ALGORITHMICA
2004
84views more  ALGORITHMICA 2004»
13 years 7 months ago
Computing Diameter in the Streaming and Sliding-Window Models
We investigate the diameter problem in the streaming and slidingwindow models. We show that, for a stream of n points or a sliding window of size n, any exact algorithm for diamet...
Joan Feigenbaum, Sampath Kannan, Jian Zhang 0004
AIPS
2004
13 years 8 months ago
Optimal Rectangle Packing: New Results
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
Richard E. Korf