Results 11  20
of
1,494,731
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
 Journal of the ACM
, 1998
"... Abstract. We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed c Ͼ 1 and given any n nodes in 2 , a randomized version of the scheme finds a (1 ϩ 1/c)approximation to the optimum traveling salesman tour in O(n(log n) O(c) ) time. When the nodes ..."
Abstract

Cited by 395 (2 self)
 Add to MetaCart
to Christofides) achieves a 3/2approximation in polynomial time. We also give similar approximation schemes for some other NPhard Euclidean problems: Minimum Steiner Tree, kTSP, and kMST. (The running times of the algorithm for kTSP and kMST involve an additional multiplicative factor k.) The previous best
An improved data stream summary: The CountMin sketch and its applications
 J. Algorithms
, 2004
"... Abstract. We introduce a new sublinear space data structure—the CountMin Sketch — for summarizing data streams. Our sketch allows fundamental queries in data stream summarization such as point, range, and inner product queries to be approximately answered very quickly; in addition, it can be applie ..."
Abstract

Cited by 412 (44 self)
 Add to MetaCart
be applied to solve several important problems in data streams such as finding quantiles, frequent items, etc. The time and space bounds we show for using the CM sketch to solve these problems significantly improve those previously known — typically from 1/ε 2 to 1/ε in factor. 1
2CNF Deletion [1].
"... Definition 1 (Min UnCut Problem) Given a graph G =(V,E), find a cut that minimizes the number of uncut edges i.e. the number of edges within each part. Remark 1 The Min UnCut problem is a complement to the MaxCut problem: The sum of the number of cut edges and uncut edges is equal to the total numbe ..."
Abstract
 Add to MetaCart
∈ S ′ : i ≥ 0}; T = {i ∈ T ′ : i ≥ 0}. Thus Min UnCut is equivalent to the following problem: Definition 2 Given a graph G =(V,E), where V = {−n,...,−1} ∪{−1,...,−n} findacut (S, T = −S) that minimizes the number of cut edges i.e. the number of edges going from the part S to T. 1.1 SDP relaxation Write
The evolving philosophers problem: dynamic change management
 IEEE Trans Softw Eng
, 1990
"... AbstractOne of the major challenges in the provision of distributed systems is the accommodation of evolutionary change. This may involve modifications or extensions to the system which were not envisaged at design time. Furthermore, in many application domains there is a requirement that the syste ..."
Abstract

Cited by 332 (17 self)
 Add to MetaCart
appropriate that changes should also be specified as structural change, in terms of component creation /deletion and connection/disconnection. These changes are then applied to the operational system itself to produce the modified system. This paper presents a model for dynamic change management which
A Data Structure for Dynamic Trees
, 1983
"... A data structure is proposed to maintain a collection of vertexdisjoint trees under a sequence of two kinds of operations: a link operation that combines two trees into one by adding an edge, and a cut operation that divides one tree into two by deleting an edge. Each operation requires O(log n) ti ..."
Abstract

Cited by 346 (21 self)
 Add to MetaCart
) time. Using this data structure, new fast algorithms are obtained for the following problems: (1) Computing nearest common ancestors. (2) Solving various network flow problems including finding maximum flows, blocking flows, and acyclic flows. (3) Computing certain kinds of constrained minimum spanning
Approximate aggregation techniques for sensor databases
 In ICDE
, 2004
"... In the emerging area of sensorbased systems, a significant challenge is to develop scalable, faulttolerant methods to extract useful information from the data the sensors collect. An approach to this data management problem is the use of sensor database systems, exemplified by TinyDB and Cougar, w ..."
Abstract

Cited by 301 (6 self)
 Add to MetaCart
In the emerging area of sensorbased systems, a significant challenge is to develop scalable, faulttolerant methods to extract useful information from the data the sensors collect. An approach to this data management problem is the use of sensor database systems, exemplified by TinyDB and Cougar
When trees collide: An approximation algorithm for the generalized Steiner problem on networks
, 1994
"... We give the first approximation algorithm for the generalized network Steiner problem, a problem in network design. An instance consists of a network with linkcosts and, for each pair fi; jg of nodes, an edgeconnectivity requirement r ij . The goal is to find a minimumcost network using the a ..."
Abstract

Cited by 248 (38 self)
 Add to MetaCart
the available links and satisfying the requirements. Our algorithm outputs a solution whose cost is within 2dlog 2 (r + 1)e of optimal, where r is the highest requirement value. In the course of proving the performance guarantee, we prove a combinatorial minmax approximate equality relating minimum
The development and comparison of robust methods for estimating the fundamental matrix
 International Journal of Computer Vision
, 1997
"... Abstract. This paper has two goals. The first is to develop a variety of robust methods for the computation of the Fundamental Matrix, the calibrationfree representation of camera motion. The methods are drawn from the principal categories of robust estimators, viz. case deletion diagnostics, Mest ..."
Abstract

Cited by 266 (10 self)
 Add to MetaCart
Abstract. This paper has two goals. The first is to develop a variety of robust methods for the computation of the Fundamental Matrix, the calibrationfree representation of camera motion. The methods are drawn from the principal categories of robust estimators, viz. case deletion diagnostics, M
Deleted
"... What is wrong with this? What can I do about it? Why should I care? 09/19/06 2 of 42Solutions ..."
Abstract
 Add to MetaCart
What is wrong with this? What can I do about it? Why should I care? 09/19/06 2 of 42Solutions
Learning With Many Irrelevant Features
 In Proceedings of the Ninth National Conference on Artificial Intelligence
, 1991
"... In many domains, an appropriate inductive bias is the MINFEATURES bias, which prefers consistent hypotheses definable over as few features as possible. This paper defines and studies this bias. First, it is shown that any learning algorithm implementing the MINFEATURES bias requires \Theta( 1 ff ..."
Abstract

Cited by 252 (4 self)
 Add to MetaCart
of FOCUS is substantially better than either ID3 or FRINGE on learning problems where the MINFEATURE...
Results 11  20
of
1,494,731