Sciweavers

1058 search results - page 9 / 212
» It's Doomed; We Can Prove It
Sort
View
AML
2007
56views more  AML 2007»
13 years 10 months ago
Radin forcing and its iterations
We provide an exposition of supercompact Radin forcing and present several methods for iterating Radin forcing. In this paper we give an exposition of supercompact Radin forcing us...
John Krueger
COMGEO
2010
ACM
13 years 10 months ago
The complexity of flow on fat terrains and its i/o-efficient computation
We study the complexity and the I/O-efficient computation of flow on triangulated terrains. We present an acyclic graph, the descent graph, that enables us to trace flow paths in ...
Mark de Berg, Otfried Cheong, Herman J. Haverkort,...
ISAAC
2004
Springer
125views Algorithms» more  ISAAC 2004»
14 years 3 months ago
Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs
RNA molecules whose secondary structures contain similar substructures often have similar functions. Therefore, an important task in the study of RNA is to develop methods for disc...
Jesper Jansson, Ngo Trung Hieu, Wing-Kin Sung
PE
2010
Springer
212views Optimization» more  PE 2010»
13 years 4 months ago
Modeling TCP throughput: An elaborated large-deviations-based model and its empirical validation
In today's Internet, a large part of the traffic is carried using the TCP transport protocol. Characterization of the variations of TCP traffic is thus a major challenge, bot...
Patrick Loiseau, Paulo Gonçalves, Julien Ba...
STOC
1990
ACM
135views Algorithms» more  STOC 1990»
14 years 1 months ago
A Separator Theorem for Graphs with an Excluded Minor and its Applications
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
Noga Alon, Paul D. Seymour, Robin Thomas