Sciweavers

53 search results - page 3 / 11
» Optimal Partitions of Data In Higher Dimensions
Sort
View
CODES
2002
IEEE
13 years 11 months ago
Communication speed selection for embedded systems with networked voltage-scalable processors
High-speed serial network interfaces are gaining wide use in connecting multiple processors and peripherals in modern embedded systems, thanks to their size advantage and power ef...
Jinfeng Liu, Pai H. Chou, Nader Bagherzadeh
SI3D
2010
ACM
14 years 1 months ago
Parallel Banding Algorithm to compute exact distance transform with the GPU
We propose a Parallel Banding Algorithm (PBA) on the GPU to compute the exact Euclidean Distance Transform (EDT) for a binary image in 2D and higher dimensions. Partitioning the i...
Thanh-Tung Cao, Ke Tang, Anis Mohamed, Tiow Seng T...
ICDE
2004
IEEE
125views Database» more  ICDE 2004»
14 years 7 months ago
Range CUBE: Efficient Cube Computation by Exploiting Data Correlation
Data cube computation and representation are prohibitively expensive in terms of time and space. Prior work has focused on either reducing the computation time or condensing the r...
Ying Feng, Divyakant Agrawal, Amr El Abbadi, Ahmed...
INFOCOM
2006
IEEE
14 years 13 days ago
Sleeping Coordination for Comprehensive Sensing Using Isotonic Regression and Domatic Partitions
— We address the problem of energy efficient sensing by adaptively coordinating the sleep schedules of sensor nodes while guaranteeing that values of sleeping nodes can be recov...
Farinaz Koushanfar, Nina Taft, Miodrag Potkonjak
SODA
2004
ACM
127views Algorithms» more  SODA 2004»
13 years 7 months ago
An optimal randomized algorithm for maximum Tukey depth
We present the first optimal algorithm to compute the maximum Tukey depth (also known as location or halfspace depth) for a non-degenerate point set in the plane. The algorithm is...
Timothy M. Chan