Sciweavers

1158 search results - page 177 / 232
» Approximation Algorithms for the Fixed-Topology Phylogenetic...
Sort
View
ICDM
2010
IEEE
164views Data Mining» more  ICDM 2010»
15 years 4 months ago
On Finding Similar Items in a Stream of Transactions
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
Andrea Campagna, Rasmus Pagh
EDBT
2006
ACM
136views Database» more  EDBT 2006»
16 years 6 months ago
Optimizing Monitoring Queries over Distributed Data
Scientific data in the life sciences is distributed over various independent multi-format databases and is constantly expanding. We discuss a scenario where a life science research...
Frank Neven, Dieter Van de Craen
ICPPW
2002
IEEE
15 years 11 months ago
Finding Multiple Routing Paths in Wide-Area WDM Networks
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...
Weifa Liang, Xiaojun Shen
BIOINFORMATICS
2007
76views more  BIOINFORMATICS 2007»
15 years 6 months ago
Optimization of primer design for the detection of variable genomic lesions in cancer
Primer approximation multiplex PCR (PAMP) is a new experimental protocol for efficiently assaying structural variation in genomes. PAMP is particularly suited to cancer genomes w...
Ali Bashir, Yu-Tsueng Liu, Benjamin J. Raphael, De...
MP
2008
135views more  MP 2008»
15 years 6 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye