Results 1  10
of
3,767
Geodesic Active Contours
, 1997
"... A novel scheme for the detection of object boundaries is presented. The technique is based on active contours evolving in time according to intrinsic geometric measures of the image. The evolving contours naturally split and merge, allowing the simultaneous detection of several objects and both in ..."
Abstract

Cited by 1425 (47 self)
 Add to MetaCart
interior and exterior boundaries. The proposed approach is based on the relation between active contours and the computation of geodesics or minimal distance curves. The minimal distance curve lays in a Riemannian space whose metric is defined by the image content. This geodesic approach for object
Pastry: Scalable, decentralized object location and routing for largescale peertopeer systems
 IN PROC. OF THE 18TH IFIP/ACM INTERNATIONAL CONFERENCE ON DISTRIBUTED SYSTEMS PLATFORMS,
, 2001
"... This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing substrate for widearea peertopeer applications. Pastry performs applicationlevel routing and object location in a potentially very large overlay network of nodes connected via the Intern ..."
Abstract

Cited by 1932 (1 self)
 Add to MetaCart
; it seeks to minimize the distance messages travel, according to a to scalar proximity metric like the number of IP routing hops. Pastry is completely decentralized, scalable, and selforganizing; it automatically adapts to the arrival, departure and failure of nodes. Experimental results obtained with a
Mining the Peanut Gallery: Opinion Extraction and Semantic Classification of Product Reviews
, 2003
"... The web contains a wealth of product reviews, but sifting through them is a daunting task. Ideally, an opinion mining tool would process a set of search results for a given item, generating a list of product attributes (quality, features, etc.) and aggregating opinions about each of them (poor, mixe ..."
Abstract

Cited by 453 (0 self)
 Add to MetaCart
, mixed, good). We begin by identifying the unique properties of this problem and develop a method for automatically distinguishing between positive and negative reviews. Our classifier draws on information retrieval techniques for feature extraction and scoring, and the results for various metrics
EIGENVALUES AND EXPANDERS
 COMBINATORICA
, 1986
"... Linear expanders have numerous applications to theoretical computer science. Here we show that a regular bipartite graph is an expander ifandonly if the second largest eigenvalue of its adjacency matrix is well separated from the first. This result, which has an analytic analogue for Riemannian mani ..."
Abstract

Cited by 400 (20 self)
 Add to MetaCart
Linear expanders have numerous applications to theoretical computer science. Here we show that a regular bipartite graph is an expander ifandonly if the second largest eigenvalue of its adjacency matrix is well separated from the first. This result, which has an analytic analogue for Riemannian
The Similarity Metric
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2003
"... A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new "normalized information distance", based on the noncomputable notion of Kolmogorov complexity, and show that it is in this class ..."
Abstract

Cited by 281 (34 self)
 Add to MetaCart
distinctive applications in widely divergent areas using standard compression programs like gzip and GenCompress. First, we compare whole mitochondrial genomes and infer their evolutionary history. This results in a first completely automatic computed whole mitochondrial phylogeny tree. Secondly, we fully
On the geometry of metric measure spaces
 II, ACTA MATH
, 2004
"... We introduce and analyze lower (’Ricci’) curvature bounds Curv(M, d,m) ≥ K for metric measure spaces (M, d,m). Our definition is based on convexity properties of the relative entropy Ent(.m) regarded as a function on the L2Wasserstein space of probability measures on the metric space (M, d). Amo ..."
Abstract

Cited by 247 (9 self)
 Add to MetaCart
convergence of metric measure spaces. We define a complete and separable metric D on the family of all isomorphism classes of normalized metric measure spaces. The metric D has a natural interpretation, based on the concept of optimal mass transportation. We also prove that the family of normalized metric measure
Basic Block Distribution Analysis to Find Periodic Behavior and Simulation Points in Applications
, 2001
"... Modern architecture research relies heavily on detailed pipeline simulation. Simulating the full execution of an industry standard benchmark can take weeks to months to complete. To overcome this problem researchers choose a very small portion of a program's execution to evaluate their results, ..."
Abstract

Cited by 315 (31 self)
 Add to MetaCart
Modern architecture research relies heavily on detailed pipeline simulation. Simulating the full execution of an industry standard benchmark can take weeks to months to complete. To overcome this problem researchers choose a very small portion of a program's execution to evaluate their results
Computing geodesics and minimal surfaces via graph cuts
 in International Conference on Computer Vision
, 2003
"... Geodesic active contours and graph cuts are two standard image segmentation techniques. We introduce a new segmentation method combining some of their benefits. Our main intuition is that any cut on a graph embedded in some continuous space can be interpreted as a contour (in 2D) or a surface (in 3D ..."
Abstract

Cited by 251 (26 self)
 Add to MetaCart
D). We show how to build a grid graph and set its edge weights so that the cost of cuts is arbitrarily close to the length (area) of the corresponding contours (surfaces) for any anisotropic Riemannian metric. There are two interesting consequences of this technical result. First, graph cut
The Completion of the Manifold of Riemannian Metrics
"... Abstract. We give a description of the completion of the manifold of all smooth Riemannian metrics on a fixed smooth, closed, finitedimensional, orientable manifold with respect to a natural metric called the L 2 metric. The primary motivation for studying this problem comes from Teichmüller theory ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
Abstract. We give a description of the completion of the manifold of all smooth Riemannian metrics on a fixed smooth, closed, finitedimensional, orientable manifold with respect to a natural metric called the L 2 metric. The primary motivation for studying this problem comes from Teichmüller
PerformanceEffective and LowComplexity Task Scheduling for Heterogeneous Computing
 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
, 2002
"... Efficient application scheduling is critical for achieving high performance in heterogeneous computing environments. The application scheduling problem has been shown to be NPcomplete in general cases as well as in several restricted cases. Because of its key importance, this problem has been exte ..."
Abstract

Cited by 255 (0 self)
 Add to MetaCart
approaches in terms of both quality and cost of schedules, which are mainly presented with schedule length ratio, speedup, frequency of best results, and average scheduling time metrics.
Results 1  10
of
3,767