Sciweavers

1436 search results - page 141 / 288
» Improved results for directed multicut
Sort
View
CORR
2007
Springer
167views Education» more  CORR 2007»
15 years 6 months ago
Approximation Algorithms for Orienteering with Time Windows
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
Chandra Chekuri, Nitish Korula
CCS
2010
ACM
15 years 6 months ago
Dialog-based payload aggregation for intrusion detection
Network-based Intrusion Detection Systems (IDSs) such as Snort or Bro that have to analyze the packet payload for all the received data show severe performance problems if used in...
Tobias Limmer, Falko Dressler
BMCBI
2008
125views more  BMCBI 2008»
15 years 6 months ago
MAID : An effect size based model for microarray data integration across laboratories and platforms
Background: Gene expression profiling has the potential to unravel molecular mechanisms behind gene regulation and identify gene targets for therapeutic interventions. As microarr...
Ivan Borozan, Limin Chen, Bryan Paeper, Jenny E. H...
ECCC
2006
116views more  ECCC 2006»
15 years 6 months ago
Uniform Hardness Amplification in NP via Monotone Codes
We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone error...
Joshua Buresh-Oppenheim, Valentine Kabanets, Rahul...
VLDB
1998
ACM
101views Database» more  VLDB 1998»
15 years 10 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...