Sciweavers

2766 search results - page 309 / 554
» Algorithms for trigonometric polynomials
Sort
View
154
Voted
COLT
2005
Springer
15 years 10 months ago
Martingale Boosting
In recent work Long and Servedio [LS05] presented a “martingale boosting” algorithm that works by constructing a branching program over weak classifiers and has a simple anal...
Philip M. Long, Rocco A. Servedio
164
Voted
ESORICS
2005
Springer
15 years 10 months ago
Privacy Preserving Clustering
The freedom and transparency of information flow on the Internet has heightened concerns of privacy. Given a set of data items, clustering algorithms group similar items together...
Somesh Jha, Louis Kruger, Patrick McDaniel
149
Voted
COMPGEOM
1993
ACM
15 years 9 months ago
Approximating Center Points with Iterated Radon Points
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
Kenneth L. Clarkson, David Eppstein, Gary L. Mille...
EUROPAR
2009
Springer
15 years 8 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, ...
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
15 years 6 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