Results 1  10
of
1,162
Quadrilateral and tetrahedral mesh stripification using 2factor partitioning of the dual graph
 VISUAL COMPUT
, 2005
"... In order to find a 2factor of a graph, there exist O(n 1.5) deterministic algorithm [7] and O(n³) randomized algorithm [14]. In this paper, we propose novel O(n log³ n log log n) algorithms to find a 2factor, if one exists, of a graph in which all n vertices have degree four or less. Such graphs ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
In order to find a 2factor of a graph, there exist O(n 1.5) deterministic algorithm [7] and O(n³) randomized algorithm [14]. In this paper, we propose novel O(n log³ n log log n) algorithms to find a 2factor, if one exists, of a graph in which all n vertices have degree four or less
Global modeling of tropospheric chemistry with assimilated meteorology: Model description and evaluation
, 2001
"... Abstract. We present a first description and evaluation of GEOSCHEM, a global threedimensional (3D) model of tropospheri chemistry driven by assimilated meteorological observations from the Goddard Earth Observing System (GEOS) of the NASA Data Assimilation Office (DAO). The model is applied to a ..."
Abstract

Cited by 459 (132 self)
 Add to MetaCart
and often much better. Concentrations of HNO3 in the remote troposphere are overestimated typically by a factor of 23, a common problem in global models that may reflect a combination of insufficient precipitation scavenging and gasaerosol partitioning not resolved by the model. The model yields
A general approximation technique for constrained forest problems
 SIAM J. COMPUT.
, 1995
"... We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph with trees, cycles, or paths satisfying certain requirements. In particular, many basic combinatorial optimization proble ..."
Abstract

Cited by 414 (21 self)
 Add to MetaCart
problems fit in this framework, including the shortest path, minimumcost spanning tree, minimumweight perfect matching, traveling salesman, and Steiner tree problems. Our technique produces approximation algorithms that run in O(n log n) time and come within a factor of 2 of optimal for most
ABSTRACT Quadrilateral and Tetrahedral Mesh Stripification Using 2Factor Partitioning of the Dual Graph
"... Finding a 2factor of a generic graph is a difficult problem and there are randomized algorithms proposed to solve this problem in O(n 3) complexity [12]. In this paper, we propose algorithms that find a 2factor of a graph, if one exists, for a restricted class of graphs in which all vertices have ..."
Abstract
 Add to MetaCart
Finding a 2factor of a generic graph is a difficult problem and there are randomized algorithms proposed to solve this problem in O(n 3) complexity [12]. In this paper, we propose algorithms that find a 2factor of a graph, if one exists, for a restricted class of graphs in which all vertices have
ATCP: TCP for Mobile Ad Hoc Networks
 IEEE Journal on selected areas in communications
, 2001
"... Transport connections set up in wireless ad hoc networks are plagued by problems such as high bit error rates (BER), frequent route changes and partitions. If we run TCP over such connections, the throughput of the connection is observed to be extremely poor because TCP treats lost or delayed ACKs a ..."
Abstract

Cited by 251 (1 self)
 Add to MetaCart
hoc network. We show that our solution improves TCP's throughput by a factor of 2 { 3. 1
A constantfactor approximation algorithm for the kmedian problem
 In Proceedings of the 31st Annual ACM Symposium on Theory of Computing
, 1999
"... We present the first constantfactor approximation algorithm for the metric kmedian problem. The kmedian problem is one of the most wellstudied clustering problems, i.e., those problems in which the aim is to partition a given set of points into clusters so that the points within a cluster are re ..."
Abstract

Cited by 249 (13 self)
 Add to MetaCart
We present the first constantfactor approximation algorithm for the metric kmedian problem. The kmedian problem is one of the most wellstudied clustering problems, i.e., those problems in which the aim is to partition a given set of points into clusters so that the points within a cluster
Split States, Entropy Enigmas, Holes and Halos
, 2007
"... We investigate degeneracies of BPS states of Dbranes on compact CalabiYau manifolds. We develop a factorization formula for BPS indices using attractor flow trees associated to multicentered black hole bound states. This enables us to study background dependence of the BPS spectrum, to compute e ..."
Abstract

Cited by 235 (22 self)
 Add to MetaCart
, and prove it can be written as a modular average of its polar part, generalizing the fareytail expansion of the elliptic genus. We show polar states are “split ” D6antiD6 bound states, and that the partition function factorizes accordingly, leading to a refined version of the OSV conjecture. This differs
Partitioned Bayesian analyses, partition choice, and the phylogenetic relationships of scincid lizards
 Syst
, 2005
"... Abstract.Partitioned Bayesian analyses of ∼2.2 kb of nucleotide sequence data (mtDNA) were used to elucidate phylogenetic relationships among 30 scincid lizard genera. Few partitioned Bayesian analyses exist in the literature, resulting in a lack of methods to determine the appropriate number of a ..."
Abstract

Cited by 112 (7 self)
 Add to MetaCart
, etc.) is shown to be a greater concern than simply the overall number of partitions. Using the criterion of the 2ln Bayes factor >10, the phylogenetic analysis employing the largest number of partitions was decisively better than all other strategies. Strategies that partitioned the ND1 gene
Efficient Partition Trees
 Discrete Comput. Geom
, 1992
"... We prove a theorem on partitioning point sets in Ed (d fixed) and give an efficient construction of partition trees based on it. Such a partition tree for n points uses O(n) space, can be constructed in O(n log n) deterministic time, and it can be used to answer simplex range queries (counting or g ..."
Abstract

Cited by 99 (8 self)
 Add to MetaCart
and tradeoffs between preprocessing (and storage) and query time are also possible. The partition result is also applied for a deterministic computation of ccuttings. E.g., given a collection of n lines in the plane and a parameter r < nl $ for a fixed 6>0, the plane can be subdivided into O(r2
The PyramidTechnique: Towards Breaking the Curse of Dimensionality
, 1998
"... In this paper, we propose the PyramidTechnique, a new indexing method for highdimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the maximum metric Lruax. In contrast to all other index structures, the performance of the PyramidTechnique does not dete ..."
Abstract

Cited by 208 (2 self)
 Add to MetaCart
not deteriorate when processing range queries on data of higher dimensionality. The PyramidTechnique is based on a special partitioning strategy which is optimized for highdimensional data. The basic idea is to divide the data space first into 2d pyramids sharing the center point of the space as a top. In a
Results 1  10
of
1,162