Sciweavers

2698 search results - page 149 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
ICC
2009
IEEE
140views Communications» more  ICC 2009»
15 years 4 months ago
Approximation Algorithms for Traffic Grooming in WDM Rings
Abstract-- This paper addresses the problem of traffic grooming in WDM rings in which all traffic emanates from a single node and all other nodes are destination nodes. This "...
Kevin Corcoran, Seth Flaxman, Mark Neyer, Peter Sc...
ISMB
1997
15 years 7 months ago
A Fast Heuristic Algorithm for a Probe Mapping Problem
Anewheuristic algorithm is presented for mapping probes to locations along the genome,given noisy pairwise distance data as input. Themodel consideredis quite general: Theinput co...
Brendan Mumey
ICDE
2008
IEEE
152views Database» more  ICDE 2008»
16 years 7 months ago
Efficient Merging and Filtering Algorithms for Approximate String Searches
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...
Chen Li, Jiaheng Lu, Yiming Lu
GBRPR
2007
Springer
15 years 10 months ago
Generalized vs Set Median Strings for Histogram-Based Distances: Algorithms and Classification Results in the Image Domain
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by it...
Christine Solnon, Jean-Michel Jolion
MOBIHOC
2008
ACM
16 years 6 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li