Sciweavers

683 search results - page 48 / 137
» A Fine-grained Analysis of a Simple Independent Set Algorith...
Sort
View
152
Voted
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
16 years 4 months ago
Fastanova: an efficient algorithm for genome-wide association study
Studying the association between quantitative phenotype (such as height or weight) and single nucleotide polymorphisms (SNPs) is an important problem in biology. To understand und...
Xiang Zhang, Fei Zou, Wei Wang 0010
141
Voted
PLDI
2003
ACM
15 years 9 months ago
Points-to analysis using BDDs
This paper reports on a new approach to solving a subset-based points-to analysis for Java using Binary Decision Diagrams (BDDs). In the model checking community, BDDs have been s...
Marc Berndl, Ondrej Lhoták, Feng Qian, Laur...
173
Voted
IPCO
2001
184views Optimization» more  IPCO 2001»
15 years 5 months ago
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
Clifford Stein, David P. Wagner
131
Voted
CIT
2004
Springer
15 years 9 months ago
TCP Based Denial-of-Service Attacks to Edge Network: Analysis and Detection
End-to-end congestion control algorithms in TCP are designed for a highly co-operative environment with the assumption that the end hosts voluntarily participate in it and obey th...
V. Anil Kumar, Dorgham Sisalem
147
Voted
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
15 years 5 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova