Sciweavers

10608 search results - page 704 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
EUROPAR
2009
Springer
15 years 11 months ago
Optimal and Near-Optimal Energy-Efficient Broadcasting in Wireless Networks
Abstract. In this paper we propose an energy-efficient broadcast algorithm for wireless networks for the case where the transmission powers of the nodes are fixed. Our algorithm is...
Christos A. Papageorgiou, Panagiotis C. Kokkinos, ...
HPDC
1995
IEEE
15 years 11 months ago
A High Speed Implementation of Adaptive Shaping for Dynamic Bandwidth Allocation
Most algorithms proposed for controlling traffic prior to entering ATM networks are based on static mechanisms. Such static control mechanisms do not account for the dynamics of ...
Cameron Braun, V. Sirkay, H. Uriona, Srini W. Seet...
ICALP
2010
Springer
15 years 9 months ago
Resource Oblivious Sorting on Multicores
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
Richard Cole, Vijaya Ramachandran
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
15 years 8 months ago
Bipartite roots of graphs
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
Lap Chi Lau
ICASSP
2010
IEEE
15 years 7 months ago
Robust regression using sparse learning for high dimensional parameter estimation problems
Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the comb...
Kaushik Mitra, Ashok Veeraraghavan, Rama Chellappa