Sciweavers

129 search results - page 12 / 26
» The Parameterized Complexity of the Minimum Shared Edges Pro...
Sort
View
99
Voted
TDSC
2010
160views more  TDSC 2010»
14 years 4 months ago
Dual-Quorum: A Highly Available and Consistent Replication System for Edge Services
This paper introduces dual-quorum replication, a novel data replication algorithm designed to support Internet edge services. Edge services allow clients to access Internet service...
Lei Gao, Michael Dahlin, Jiandan Zheng, Lorenzo Al...
ICASSP
2008
IEEE
15 years 4 months ago
Parameterized design framework for hardware implementation of particle filters
Particle filtering methods provide powerful techniques for solving non-linear state-estimation problems, and are applied to a variety of application areas in signal processing. Be...
Sankalita Saha, Neal K. Bambha, Shuvra S. Bhattach...
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
14 years 10 months ago
The rectilinear Steiner arborescence problem is NP-complete
Given a set P of points in the first quadrant, a Rectilinear Steiner Arborescence (RSA) is a directed tree rooted at the origin, containing all points in P, and composed solely of...
Weiping Shi, Chen Su
IWPEC
2009
Springer
15 years 4 months ago
What Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
15 years 6 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...