• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 12,759
Next 10 →

Node Labels in Local Decision

by Pierre Fraigniaud, Juho Hirvonen, Jukka Suomela
"... Abstract. The role of unique node identifiers in network computing is well understood as far as symmetry breaking is concerned. However, the unique identifiers also leak information about the computing environment—in particular, they provide some nodes with information related to the size of the net ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
of the network. It was recently proved that in the context of local decision, there are some decision problems such that (1) they cannot be solved without unique identifiers, and (2) unique node identifiers leak a sufficient amount of information such that the problem becomes solvable (PODC 2013). In this work

GPSR: Greedy perimeter stateless routing for wireless networks

by Brad Karp, H. T. Kung - MOBICOM , 2000
"... We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of touters and a packer's destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router's i ..."
Abstract - Cited by 2290 (8 self) - Add to MetaCart
We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of touters and a packer's destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router

Efficient graph-based image segmentation.

by Pedro F Felzenszwalb , Daniel P Huttenlocher - International Journal of Computer Vision, , 2004
"... Abstract. This paper addresses the problem of segmenting an image into regions. We define a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then develop an efficient segmentation algorithm based on this predicate, and show ..."
Abstract - Cited by 940 (1 self) - Add to MetaCart
that although this algorithm makes greedy decisions it produces segmentations that satisfy global properties. We apply the algorithm to image segmentation using two different kinds of local neighborhoods in constructing the graph, and illustrate the results with both real and synthetic images. The algorithm

Network Coding for Large Scale Content Distribution

by Christos Gkantsidis, Pablo Rodriguez Rodriguez
"... We propose a new scheme for content distribution of large files that is based on network coding. With network coding, each node of the distribution network is able to generate and transmit encoded blocks of information. The randomization introduced by the coding process eases the scheduling of bloc ..."
Abstract - Cited by 493 (7 self) - Add to MetaCart
of block propagation, and, thus, makes the distribution more efficient. This is particularly important in large unstructured overlay networks, where the nodes need to make decisions based on local information only. We compare network coding to other schemes that transmit unencoded information (i.e. blocks

On the Impact of Identifiers on Local Decision

by Pierre Fraigniaud, Magnús M. Halldórsson, Amos Korman
"... The issue of identifiers is crucial in distributed computing. Informally, identities are used for tackling two of the fundamental difficulties that are inherent to deterministic distributed computing, namely: (1) symmetry breaking, and (2) topological information gathering. In the context of local c ..."
Abstract - Cited by 7 (5 self) - Add to MetaCart
, for the identities to play no role, some other kinds of mechanisms for breaking symmetry must be employed, such as edgelabeling or sense of direction. When it comes to local distributed decision problems, the specification of the decision task does not seem to involve symmetry breaking. Therefore, it is expected

Participation in Local Decision Making The

by unknown authors
"... Board is the ultimate decision-maker in those areas assigned to it by state and federal laws and regulations. In executing that responsibility, the Board is committed to its obligation to ensure that appropriate members of the District participate in developing recommended policies for Board action ..."
Abstract - Add to MetaCart
Board is the ultimate decision-maker in those areas assigned to it by state and federal laws and regulations. In executing that responsibility, the Board is committed to its obligation to ensure that appropriate members of the District participate in developing recommended policies for Board action

Participation in Local Decision Making The

by unknown authors
"... Board is the ultimate decision-maker in those areas assigned to it by state and federal laws and regulations. In executing that responsibility, the Board is committed to its obligation to ensure that appropriate members of the District participate in developing recommended policies for Board action ..."
Abstract - Add to MetaCart
Board is the ultimate decision-maker in those areas assigned to it by state and federal laws and regulations. In executing that responsibility, the Board is committed to its obligation to ensure that appropriate members of the District participate in developing recommended policies for Board action

Adaptive Fusion of Correlated Local Decisions

by Jian-Guo Chen , Nirwan Ansari - IEEE TRANS. ON SYSTEMS, MAN, AND CYBERNETICS , 1998
"... In this paper, an adaptive fusion algorithm is proposed for an environment where the observations and local decisions are dependent from one sensor to another. An optimal decision rule, based on the maximum posterior probability (MAP) detection criterion for such an environment, is derived and compa ..."
Abstract - Cited by 9 (0 self) - Add to MetaCart
In this paper, an adaptive fusion algorithm is proposed for an environment where the observations and local decisions are dependent from one sensor to another. An optimal decision rule, based on the maximum posterior probability (MAP) detection criterion for such an environment, is derived

Numeral Recognition by Weighting Local Decisions

by G. Dimauro, S. Impedovo, R. Modugno, G. Pirlo
"... This paper presents a new technique to improve the combination of classification decisions obtained from local analysis of patterns. Specifically, a genetic algorithm is used to determine the optimal weight vector to balance the local decisions in the combination process. The experimental results, c ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
This paper presents a new technique to improve the combination of classification decisions obtained from local analysis of patterns. Specifically, a genetic algorithm is used to determine the optimal weight vector to balance the local decisions in the combination process. The experimental results

Distributed topology control for power efficient operation in multihop wireless ad hoc networks

by Roger Wattenhofer, Li Li, Paramvir Bahl, Yi-min Wang , 2001
"... Abstract — The topology of wireless multihop ad hoc networks can be controlled by varying the transmission power of each node. We propose a simple distributed algorithm where each node makes local decisions about its transmission power and these local decisions collectively guarantee global connecti ..."
Abstract - Cited by 383 (18 self) - Add to MetaCart
Abstract — The topology of wireless multihop ad hoc networks can be controlled by varying the transmission power of each node. We propose a simple distributed algorithm where each node makes local decisions about its transmission power and these local decisions collectively guarantee global
Next 10 →
Results 1 - 10 of 12,759
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University