Results 1  10
of
5,622
CURE: An Efficient Clustering Algorithm for Large Data sets
 Published in the Proceedings of the ACM SIGMOD Conference
, 1998
"... Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clusters with spherical shapes and similar sizes, or are very fragile in the presence of outliers. We propose a new clustering ..."
Abstract

Cited by 722 (5 self)
 Add to MetaCart
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clusters with spherical shapes and similar sizes, or are very fragile in the presence of outliers. We propose a new
A message ferrying approach for data delivery in sparse mobile ad hoc networks
 In Proc. of ACM Mobihoc
, 2004
"... Mobile Ad Hoc Networks (MANETs) provide rapidly deployable and selfconfiguring network capacity required in many critical applications, e.g., battlefields, disaster relief and wide area sensing. In this paper we study the problem of efficient data delivery in sparse MANETs where network partitions ..."
Abstract

Cited by 498 (14 self)
 Add to MetaCart
Mobile Ad Hoc Networks (MANETs) provide rapidly deployable and selfconfiguring network capacity required in many critical applications, e.g., battlefields, disaster relief and wide area sensing. In this paper we study the problem of efficient data delivery in sparse MANETs where network partitions
ROCK: A Robust Clustering Algorithm for Categorical Attributes
 In Proc.ofthe15thInt.Conf.onDataEngineering
, 2000
"... Clustering, in data mining, is useful to discover distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based (e.g., euclidean) similarity measure in order to partition the database such that data points in the same partition are more similar than point ..."
Abstract

Cited by 446 (2 self)
 Add to MetaCart
Clustering, in data mining, is useful to discover distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based (e.g., euclidean) similarity measure in order to partition the database such that data points in the same partition are more similar than
The grid file: an adaptable, symmetric multikey file structure
 In Trends in Information Processing Systems, Proc. 3rd ECZ Conference, A. Duijvestijn and P. Lockemann, Eds., Lecture Notes in Computer Science 123
, 1981
"... Traditional file structures that provide multikey access to records, for example, inverted files, are extensions of file structures originally designed for singlekey access. They manifest various deficiencies in particular for multikey access to highly dynamic files. We study the dynamic aspects of ..."
Abstract

Cited by 426 (4 self)
 Add to MetaCart
partition of the search space and of a grid directory, which are the keys to a dynamic file structure called the grid file. This tile system adapts gracefully to its contents under insertions and deletions, and thus achieves an upper hound of two disk accesses for single record retrieval; it also handles
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
of these problems. For instance, we obtain a 2approximation algorithm for the minimumweight perfect matching problem under the triangle inequality. Our running time of O(n log n) time compares favorably with the best strongly polynomial exact algorithms running in O(n 3) time for dense graphs. A similar result
On visible surface generation by a priori tree structures
 Computer Graphics
, 1980
"... This paper describes a new algorithm for solving the hidden surface (or line) problem, to more rapidly generate realistic images of 3D scenes composed of polygons, and presents the development of theoretical foundations in the area as well as additional related algorithms. As in many applications t ..."
Abstract

Cited by 370 (6 self)
 Add to MetaCart
;quot;ninary space partitioning " tree whose inorder traversal of visibility priority at runtime will produce a lineaL " order, dependent upon the viewing position, on (parts of) the polygons, which can then be used to easily solve the hidden surfac6 problem. In the application where the entire
Topologicallyaware overlay construction and server selection
, 2002
"... A number of largescale distributed Internet applications could potentially benefit from some level of knowledge about the relative proximity between its participating host nodes. For example, the performance of large overlay networks could be improved if the applicationlevel connectivity between ..."
Abstract

Cited by 341 (3 self)
 Add to MetaCart
between the nodes in these networks is congruent with the underlying IPlevel topology. Similarly, in the case of replicated web content, client nodes could use topological information in selecting one of multiple available servers. For such applications, one need not find the optimal solution in order
The Partition of Unity Method
 International Journal of Numerical Methods in Engineering
, 1996
"... A new finite element method is presented that features the ability to include in the finite element space knowledge about the partial differential equation being solved. This new method can therefore be more efficient than the usual finite element methods. An additional feature of the partitionofu ..."
Abstract

Cited by 211 (2 self)
 Add to MetaCart
A new finite element method is presented that features the ability to include in the finite element space knowledge about the partial differential equation being solved. This new method can therefore be more efficient than the usual finite element methods. An additional feature of the partition
The Partition of Unity Finite Element Method: Basic Theory and Applications
, 1996
"... The paper presents the basic ideas and the mathematical foundation of the partition of unity nite element method (PUFEM). We will show howthe PUFEM can be used to employ the structure of the differential equation under consideration to construct effective and robust methods. Although the method and ..."
Abstract

Cited by 251 (8 self)
 Add to MetaCart
The paper presents the basic ideas and the mathematical foundation of the partition of unity nite element method (PUFEM). We will show howthe PUFEM can be used to employ the structure of the differential equation under consideration to construct effective and robust methods. Although the method
Geodesic Active Regions and Level Set Methods for Supervised Texture Segmentation
 INTERNATIONAL JOURNAL OF COMPUTER VISION
, 2002
"... This paper presents a novel variational framework to deal with frame partition problems in Computer Vision. This framework exploits boundary and regionbased segmentation modules under a curvebased optimization objective function. The task of supervised texture segmentation is considered to demonst ..."
Abstract

Cited by 312 (9 self)
 Add to MetaCart
This paper presents a novel variational framework to deal with frame partition problems in Computer Vision. This framework exploits boundary and regionbased segmentation modules under a curvebased optimization objective function. The task of supervised texture segmentation is considered
Results 1  10
of
5,622