• 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 122,754
Next 10 →

On Distributed Algorithms in a Broadcast Domain

by Danny Dolev, Dalia Malki - Proceedings of the Sixth WDAG; Israel , 1993
"... . This paper studies the usage of broadcast communication in distributed services. The approach taken is practical: all the algorithms are asynchronous, and tolerate realistic faults. We study four problems in a broadcast domain: clock synchronization, reliable and ordered broadcast, membership, and ..."
Abstract - Cited by 22 (6 self) - Add to MetaCart
. This paper studies the usage of broadcast communication in distributed services. The approach taken is practical: all the algorithms are asynchronous, and tolerate realistic faults. We study four problems in a broadcast domain: clock synchronization, reliable and ordered broadcast, membership

Total Ordering of Messages in Broadcast Domains

by Danny Dolev, Shlomo Kramer, Dalia Malki , 1992
"... This paper presents the construction of a multicast service, called agreed multicast, that guarantees that messages arrive reliably and in the same total-order to all their destinations. ToTo, a novel family of protocols, implement the agreed multicast service of Transis, a communication sub-system ..."
Abstract - Cited by 8 (2 self) - Add to MetaCart
This paper presents the construction of a multicast service, called agreed multicast, that guarantees that messages arrive reliably and in the same total-order to all their destinations. ToTo, a novel family of protocols, implement the agreed multicast service of Transis, a communication sub-system for the High Availability project, currently developed at the Hebrew University of Jerusalem. This service is desired in distributed systems, and supports high level coordination among groups of processes in distributed applications. The ToTo protocols are genuinely symmetric. They are fairly simple and do not bear a significant processing burden. The cost of symmetric total ordering protocols can be measured by the number of messages from different machines needed to agree on the next set of messages to be delivered in total order. The ToTo protocols provide early delivery latency, and require as little as n 2 messages for delivery. Thus, we optimize the time that elapses from the point ...

On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks

by Jeffrey E. Wieselthier, Gam D. Nguyen, Anthony Ephremides , 2000
"... wieselthier @ itd.nrl.navy.mil nguyen @ itd.nrl.navy.mil ..."
Abstract - Cited by 554 (13 self) - Add to MetaCart
wieselthier @ itd.nrl.navy.mil nguyen @ itd.nrl.navy.mil

Aggregated Quantities in a Single Broadcast Domain)

by Björn Andersson, Nuno Pereira, Wilfried Elmenreich, Eduardo Tovar, Filipe Pacheco, Nuno Cruz, Björn Andersson, Nuno Pereira, Wilfried Elmenreich, Eduardo Tovar, Filipe Pacheco
"... The availability of small inexpensive sensor elements enables the employment of large wired or wireless sensor networks for feeding control systems. Unfortunately, the need to transmit a large number of sensor measurements over a network negatively affects the timing parameters of the control loop. ..."
Abstract - Add to MetaCart
The availability of small inexpensive sensor elements enables the employment of large wired or wireless sensor networks for feeding control systems. Unfortunately, the need to transmit a large number of sensor measurements over a network negatively affects the timing parameters of the control loop. This paper presents a solution to this problem by representing sensor measurements with an approximate representation--- an interpolation of sensor measurements as a function of space coordinates. A priority-based medium access control (MAC) protocol is used to select the sensor messages with high information content. Thus, the information from a large number of sensor measurements is conveyed within a few messages. This approach greatly reduces the time for obtaining a snapshot of the environment state and therefore supports the real-time requirements of feedback control loops.

1 Link Scheduling in a Single Broadcast Domain Underwater Networks

by unknown authors
"... Because radio waves decay rapidly in sea water, acoustic communication is the most popular choic for underwater sensor networks. However, since the propagation speed of acoustic waves are 3 orders slower than radio waves, scheduling techniques designed for radio-based communication systems may not b ..."
Abstract - Add to MetaCart
not be suitable for underwater use. We consider how to time schedule each link in a broadcast domain once. We show that, unlike its terrestrial RF counterpart, this problem is NP complete. We then use a complete SAT solver to investigate the relation between the schedule length and the satisfiability of a given

Towards flexible teamwork

by Milind Tambe - JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH , 1997
"... Many AI researchers are today striving to build agent teams for complex, dynamic multi-agent domains, with intended applications in arenas such as education, training, entertainment, information integration, and collective robotics. Unfortunately, uncertainties in these complex, dynamic domains obst ..."
Abstract - Cited by 571 (57 self) - Add to MetaCart
Many AI researchers are today striving to build agent teams for complex, dynamic multi-agent domains, with intended applications in arenas such as education, training, entertainment, information integration, and collective robotics. Unfortunately, uncertainties in these complex, dynamic domains

Computing semantic relatedness using Wikipedia-based explicit semantic analysis

by Evgeniy Gabrilovich, Shaul Markovitch - In Proceedings of the 20th International Joint Conference on Artificial Intelligence , 2007
"... Computing semantic relatedness of natural language texts requires access to vast amounts of common-sense and domain-specific world knowledge. We propose Explicit Semantic Analysis (ESA), a novel method that represents the meaning of texts in a high-dimensional space of concepts derived from Wikipedi ..."
Abstract - Cited by 546 (9 self) - Add to MetaCart
Computing semantic relatedness of natural language texts requires access to vast amounts of common-sense and domain-specific world knowledge. We propose Explicit Semantic Analysis (ESA), a novel method that represents the meaning of texts in a high-dimensional space of concepts derived from

Probabilistic Latent Semantic Indexing

by Thomas Hofmann , 1999
"... Probabilistic Latent Semantic Indexing is a novel approach to automated document indexing which is based on a statistical latent class model for factor analysis of count data. Fitted from a training corpus of text documents by a generalization of the Expectation Maximization algorithm, the utilized ..."
Abstract - Cited by 1207 (11 self) - Add to MetaCart
model is able to deal with domain-specific synonymy as well as with polysemous words. In contrast to standard Latent Semantic Indexing (LSI) by Singular Value Decomposition, the probabilistic variant has a solid statistical foundation and defines a proper generative data model. Retrieval experiments

Quantization Index Modulation: A Class of Provably Good Methods for Digital Watermarking and Information Embedding

by Brian Chen, Gregory W. Wornell - IEEE TRANS. ON INFORMATION THEORY , 1999
"... We consider the problem of embedding one signal (e.g., a digital watermark), within another "host" signal to form a third, "composite" signal. The embedding is designed to achieve efficient tradeoffs among the three conflicting goals of maximizing information-embedding rate, mini ..."
Abstract - Cited by 495 (15 self) - Add to MetaCart
(AWGN) channels, which may be good models for hybrid transmission applications such as digital audio broadcasting, and mean-square-error-constrained attack channels that model private-key watermarking applications.

DiSCo — A German Evaluation Corpus for Challenging Problems in the Broadcast Domain

by Doris Baum, Daniel Schneider, Rolf Bardeli, Jochen Schwenninger, Barbara Samlowski, Thomas Winkler, Joachim Köhler
"... Typical broadcast material contains not only studio-recorded texts read by trained speakers, but also spontaneous and dialect speech, debates with cross-talk, voice-overs, and on-site reports with difficult acoustic environments. Standard approaches to speech and speaker recognition usually deterior ..."
Abstract - Add to MetaCart
deteriorate under such conditions. This paper reports on the design, construction, and experimental analysis of DiSCo, a German corpus for the evaluation of speech and speaker recognition on challenging material from the broadcast domain. One of the key requirements for the design of this corpus was a good
Next 10 →
Results 1 - 10 of 122,754
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