Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
8,411
GPS-Less Low Cost Outdoor Localization for Very Small Devices.
- IEEE Personal Communications Magazine,
, 2000
"... Abstract-Instrumenting 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
points. The accuracy of localization is then dependent on the separation distance between two adjacent reference points and the transmission range of these reference points. Initial experimental results show that the accuracy for 90% of our data points is within one-third of the separation distance
Algebraic Graph Theory
, 2011
"... Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism groups of graphs along with the use of algebraic tools to establish interesting properties of combinatorial objects. One of the oldest themes in the area is the investiga ..."
Abstract
-
Cited by 892 (13 self)
- Add to MetaCart
Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism groups of graphs along with the use of algebraic tools to establish interesting properties of combinatorial objects. One of the oldest themes in the area
Mining Sequential Patterns: Generalizations and Performance Improvements
- RESEARCH REPORT RJ 9994, IBM ALMADEN RESEARCH
, 1995
"... The problem of mining sequential patterns was recently introduced in [3]. We are given a database of sequences, where each sequence is a list of transactions ordered by transaction-time, and each transaction is a set of items. The problem is to discover all sequential patterns with a user-specified ..."
Abstract
-
Cited by 759 (5 self)
- Add to MetaCart
-specified minimum support, where the support of a pattern is the number of data-sequences that contain the pattern. An example of a sequential pattern is "5 % of customers bought `Foundation' and `Ringworld' in one transaction, followed by `Second Foundation ' in a later transaction". We
A distributed algorithm for minimum-weight spanning trees
, 1983
"... A distributed algorithm is presented that constructs he minimum-weight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm and exchange ..."
Abstract
-
Cited by 435 (3 self)
- Add to MetaCart
A distributed algorithm is presented that constructs he minimum-weight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm
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
Approximation Algorithms for Connected Dominating Sets
- Algorithmica
, 1996
"... The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to some node in the dominating set. We focus on the question of finding a connected dominating set of minimum size, whe ..."
Abstract
-
Cited by 366 (9 self)
- Add to MetaCart
The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to some node in the dominating set. We focus on the question of finding a connected dominating set of minimum size
Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data
- IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS
, 2006
"... A compound graph is a frequently encountered type of data set. Relations are given between items, and a hierarchy is defined on the items as well. We present a new method for visualizing such compound graphs. Our approach is based on visually bundling the adjacency edges, i.e., non-hierarchical edge ..."
Abstract
-
Cited by 271 (12 self)
- Add to MetaCart
-hierarchical edges, together. We realize this as follows. We assume that the hierarchy is shown via a standard tree visualization method. Next, we bend each adjacency edge, modeled as a B-spline curve, toward the polyline defined by the path via the inclusion edges from one node to another. This hierarchical
Peer Effects in the Classroom: Learning from Gender and Race Variation
, 2000
"... Peer effects are potentially important for understanding the optimal organization of schools, jobs, and neighborhoods, but finding evidence is difficult because people are selected into peer groups based, in part, on their unobservable characteristics. I identify the effects of peers whom a child en ..."
Abstract
-
Cited by 335 (4 self)
- Add to MetaCart
encounters in the classroom using sources of variation that are credibly idiosyncratic, such as changes in the gender and racial composition of a grade in a school in adjacent years. I use specification tests, including one based on randomizing the order of years, to confirm that the variation I use
Edgebreaker: Connectivity compression for triangle meshes
- IEEE Transactions on Visualization and Computer Graphics
, 1999
"... Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called connectivity or topology) of three-dimensional triangle meshes. Edgebreaker improves upon the worst case storage required by previously reported schemes, most of which require O(nlogn) bits to store ..."
Abstract
-
Cited by 298 (24 self)
- Add to MetaCart
triangle to an adjacent one. At each stage, compression produces an op-code describing the topological relation between the current triangle and the boundary of the remaining part of the mesh. Decompression uses these op-codes to reconstruct the entire incidence graph. Because Edgebreaker’s compression
Distributed Quality-of-Service Routing in Ad-Hoc Networks
- IEEE Journal on Selected Areas in Communications
, 1999
"... In an ad-hoc network, all communication is done over wireless media, typically by radio through air, without the help of wired base stations. Since direct communication is allowed only between adjacent nodes, distant nodes communicate over multiple hops. The quality-ofservice (QoS) routing in an ad- ..."
Abstract
-
Cited by 299 (4 self)
- Add to MetaCart
In an ad-hoc network, all communication is done over wireless media, typically by radio through air, without the help of wired base stations. Since direct communication is allowed only between adjacent nodes, distant nodes communicate over multiple hops. The quality-ofservice (QoS) routing in an ad
Results 1 - 10
of
8,411
