Sciweavers

1161 search results - page 60 / 233
» Approximation schemes for clustering problems
Sort
View
PEPM
1991
ACM
15 years 1 months ago
The Semantics of Scheme Control-Flow Analysis
This is a follow-on to my 1988PLDIpaper, “Control-Flow Analysis e”[9]. Iusethe methodofabstractsemanticinterpretations to explicate the control-flow analysis technique presen...
Olin Shivers
SSS
2009
Springer
162views Control Systems» more  SSS 2009»
15 years 4 months ago
Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...
André Schumacher, Harri Haanpää
ISPA
2004
Springer
15 years 3 months ago
MPICH-GP: A Private-IP-Enabled MPI Over Grid Environments
This paper presents an overview of MPICH-GP, which extends the MPICH-G2 functionality to support private IP clusters. To support the communication among private IP clusters, the MP...
Kumrye Park, Sung-Yong Park, Oh-Young Kwon, Hyoung...
CPM
1999
Springer
127views Combinatorics» more  CPM 1999»
15 years 2 months ago
A New Indexing Method for Approximate String Matching
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
Gonzalo Navarro, Ricardo A. Baeza-Yates
SIAMNUM
2010
105views more  SIAMNUM 2010»
14 years 4 months ago
Quantization Based Filtering Method Using First Order Approximation
The quantization based filtering method (see [13], [14]) is a grid based approximation method to solve nonlinear filtering problems with discrete time observations. It relies on o...
Afef Sellami