Sciweavers

2477 search results - page 72 / 496
» Approximate extended formulations
Sort
View
158
Voted
BMCBI
2006
138views more  BMCBI 2006»
15 years 3 months ago
Approximation properties of haplotype tagging
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
Staal A. Vinterbo, Stephan Dreiseitl, Lucila Ohno-...
SIGMOD
2002
ACM
127views Database» more  SIGMOD 2002»
16 years 3 months ago
Approximate XML joins
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
Sudipto Guha, H. V. Jagadish, Nick Koudas, Divesh ...
144
Voted
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
15 years 8 months ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
132
Voted
TELETRAFFIC
2007
Springer
15 years 10 months ago
Network Capacity Allocation in Service Overlay Networks
We study the capacity allocation problem in service overlay networks (SON)s with state-dependent connection routing based on revenue maximization. We formulate the dimensioning pro...
Ngok Lam, Zbigniew Dziong, Lorne Mason
124
Voted
MOC
2010
14 years 10 months ago
hp-Optimal discontinuous Galerkin methods for linear elliptic problems
Abstract. The aim of this paper is to present and analyze a class of hpversion discontinuous Galerkin (DG) discretizations for the numerical approximation of linear elliptic proble...
Benjamin Stamm, Thomas P. Wihler