Results 1  10
of
6,578
GPSLess Low Cost Outdoor Localization for Very Small Devices.
 IEEE Personal Communications Magazine,
, 2000
"... AbstractInstrumenting the physical world through large networks of wireless sensor nodes, particularly for applications like environmental monitoring of water and soil, requires that these nodes be very small, light, untethered and unobtrusive. The problem of localization, i.e., determining where ..."
Abstract

Cited by 1000 (27 self)
 Add to MetaCart
in these networks. In this paper, we review localization techniques and evaluate the effectiveness of a very simple connectivitymetric method for localization in outdoor environments that makes use of the inherent radiofrequency (RF) communications capabilities of these devices. A fixed number of reference points
Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching
, 2002
"... Matching elements of two data schemas or two data instances plays a key role in data warehousing, ebusiness, or even biochemical applications. In this paper we present a matching algorithm based on a fixpoint computation that is usable across different scenarios. The algorithm takes two graphs (sch ..."
Abstract

Cited by 592 (12 self)
 Add to MetaCart
(schemas, catalogs, or other data structures) as input, and produces as output a mapping between corresponding nodes of the graphs. Depending on the matching goal, a subset of the mapping is chosen using filters. After our algorithm runs, we expect a human to check and if necessary adjust the results. As a
An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions
 ACMSIAM SYMPOSIUM ON DISCRETE ALGORITHMS
, 1994
"... Consider a set S of n data points in real ddimensional space, R d , where distances are measured using any Minkowski metric. In nearest neighbor searching we preprocess S into a data structure, so that given any query point q 2 R d , the closest point of S to q can be reported quickly. Given any po ..."
Abstract

Cited by 984 (32 self)
 Add to MetaCart
Consider a set S of n data points in real ddimensional space, R d , where distances are measured using any Minkowski metric. In nearest neighbor searching we preprocess S into a data structure, so that given any query point q 2 R d , the closest point of S to q can be reported quickly. Given any
The geometry of graphs and some of its algorithmic applications
 COMBINATORICA
, 1995
"... In this paper we explore some implications of viewing graphs as geometric objects. This approach offers a new perspective on a number of graphtheoretic and algorithmic problems. There are several ways to model graphs geometrically and our main concern here is with geometric representations that res ..."
Abstract

Cited by 524 (19 self)
 Add to MetaCart
that respect the metric of the (possibly weighted) graph. Given a graph G we map its vertices to a normed space in an attempt to (i) Keep down the dimension of the host space and (ii) Guarantee a small distortion, i.e., make sure that distances between vertices in G closely match the distances between
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
Ricci Flow with Surgery on ThreeManifolds
"... This is a technical paper, which is a continuation of [I]. Here we verify most of the assertions, made in [I, §13]; the exceptions are (1) the statement that a 3manifold which collapses with local lower bound for sectional curvature is a graph manifold this is deferred to a separate paper, as the ..."
Abstract

Cited by 448 (2 self)
 Add to MetaCart
of all points (x ′ , t ′ ) with x ′ ∈ B(x, t, r) and t ′ ∈ [t, t + △t] or t ′ ∈ [t + △t, t], depending on the sign of △t. A ball B(x, t, ǫ −1 r) is called an ǫneck, if, after scaling the metric with factor r −2, it is ǫclose to the standard neck S 2 × I, with the product metric, where S 2 has
S.: Definition of metric dependencies for monitoring the impact of quality of services on quality of processes
 In: IEEE/IFIP 2007
, 2007
"... Abstract—Service providers have to monitor the quality of offered services and to ensure the compliance of service levels provider and requester agreed on. Thereby, a service provider should notify a service requester about violations of service level agreements (SLAs). Furthermore, the provider sho ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
on measurable metrics related to functional elements of processes, services as well as components implementing services. Based on functional dependencies between processes and services of a serviceoriented architecture (SOA), we define metric dependencies for monitoring the impact of quality of invoked
How many miles to βω? — Approximating βω by metricdependent compactifications
 Topology Appl
"... It is known that the StoneČech compactification βX of a noncompact locally compact metric space X is approximated by the collection of Smirnov compactifications of X for all compatible metrics on X. We investigate the smallest cardinality of a set D of compatible metrics on ω such that, βω is ap ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
It is known that the StoneČech compactification βX of a noncompact locally compact metric space X is approximated by the collection of Smirnov compactifications of X for all compatible metrics on X. We investigate the smallest cardinality of a set D of compatible metrics on ω such that, βω
METRIC DEPENDENCE AND ASYMPTOTIC MINIMIZATION OF THE EXPECTED NUMBER OF CRITICAL POINTS OF RANDOM HOLOMORPHIC SECTIONS
, 802
"... Abstract. We prove the main conjecture from [DSZ2] concerning the metric dependence and asymptotic minimization of the expected number N crit N,h of critical points of random holomorphic sections of the Nth tensor power of a positive line bundle. The first nontopological term in the asymptotic expan ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We prove the main conjecture from [DSZ2] concerning the metric dependence and asymptotic minimization of the expected number N crit N,h of critical points of random holomorphic sections of the Nth tensor power of a positive line bundle. The first nontopological term in the asymptotic
Results 1  10
of
6,578