Sciweavers

2069 search results - page 308 / 414
» Linear time algorithms for Clobber
Sort
View
SODA
2008
ACM
200views Algorithms» more  SODA 2008»
15 years 7 months ago
Clustering for metric and non-metric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
Marcel R. Ackermann, Johannes Blömer, Christi...
INFOCOM
2009
IEEE
16 years 1 months ago
Computing the Capacity Region of a Wireless Network
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
APPROX
2007
Springer
160views Algorithms» more  APPROX 2007»
16 years 17 days ago
Better Binary List-Decodable Codes Via Multilevel Concatenation
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
Venkatesan Guruswami, Atri Rudra
LCTRTS
2007
Springer
16 years 16 days ago
Frequency-aware energy optimization for real-time periodic and aperiodic tasks
Energy efficiency is an important factor in embedded systems design. We consider an embedded system with a dynamic voltage scaling (DVS) capable processor and its system-wide pow...
Xiliang Zhong, Cheng-Zhong Xu
IMR
2004
Springer
15 years 11 months ago
Efficient Spacetime Meshing with Nonlocal Cone Constraints
Spacetime Discontinuous Galerkin (DG) methods are used to solve hyperbolic PDEs describing wavelike physical phenomena. When the PDEs are nonlinear, the speed of propagation of th...
Shripad Thite