Results 1 - 10 of 67,351

Cluster Ensembles - A Knowledge Reuse Framework for Combining Multiple Partitions

by Alexander Strehl, Joydeep Ghosh, Claire Cardie - Journal of Machine Learning Research , 2002
"... This paper introduces the problem of combining multiple partitionings of a set of objects into a single consolidated clustering without accessing the features or algorithms that determined these partitionings. We first identify several application scenarios for the resultant 'knowledge reuse&ap ..."
Abstract - Cited by 603 (20 self) - Add to MetaCart
This paper introduces the problem of combining multiple partitionings of a set of objects into a single consolidated clustering without accessing the features or algorithms that determined these partitionings. We first identify several application scenarios for the resultant 'knowledge reuse

Receiver-driven Layered Multicast

by Steven McCanne, Van Jacobson, Martin Vetterli , 1996
"... State of the art, real-time, rate-adaptive, multimedia applications adjust their transmission rate to match the available network capacity. Unfortunately, this source-based rate-adaptation performs poorly in a heterogeneous multicast environment because there is no single target rate — the conflicti ..."
Abstract - Cited by 737 (22 self) - Add to MetaCart
receiver specifies its level of subscription by joining a subset of the groups. In this paper, we extend the multiple group framework with a rate-adaptation protocol called Receiver-driven Layered Multicast, or RLM. Under RLM, multicast receivers adapt to both the static heterogeneity of link bandwidths

An Algorithm for Tracking Multiple Targets

by Donald B. Reid - IEEE Transactions on Automatic Control , 1979
"... Abstract—An algorithm for tracking multiple targets In a cluttered algorithms. Clustering is the process of dividing the entire environment Is developed. The algorithm Is capable of Initiating tracks, set of targets and measurements into independent groups accounting for false or m[~clngreports, and ..."
Abstract - Cited by 596 (0 self) - Add to MetaCart
Abstract—An algorithm for tracking multiple targets In a cluttered algorithms. Clustering is the process of dividing the entire environment Is developed. The algorithm Is capable of Initiating tracks, set of targets and measurements into independent groups accounting for false or m

PVM: A Framework for Parallel Distributed Computing

by V. S. Sunderam - Concurrency: Practice and Experience , 1990
"... The PVM system is a programming environment for the development and execution of large concurrent or parallel applications that consist of many interacting, but relatively independent, components. It is intended to operate on a collection of heterogeneous computing elements interconnected by one or ..."
Abstract - Cited by 788 (27 self) - Add to MetaCart
of various types of algorithms (and their interactions), while the underlying infrastructure permits the execution of applications on a virtual computing environment that supports multiple parallel computation models. PVM contains facilities for concurrent, sequential, or conditional execution of application

Resource Description Framework (RDF) Model and Syntax Specification

by Ora Lassila, Ralph R. Swick, World Wide, Web Consortium , 1998
"... This document is a revision of the public working draft dated 1998-08-19 incorporating suggestions received in review comments and further deliberations of the W3C RDF Model and Syntax Working Group. With the publication of this draft, the RDF Model and Syntax Specification enters "last call.&q ..."
Abstract - Cited by 926 (6 self) - Add to MetaCart
This document is a revision of the public working draft dated 1998-08-19 incorporating suggestions received in review comments and further deliberations of the W3C RDF Model and Syntax Working Group. With the publication of this draft, the RDF Model and Syntax Specification enters "last call

Markov games as a framework for multi-agent reinforcement learning

by Michael L. Littman - IN PROCEEDINGS OF THE ELEVENTH INTERNATIONAL CONFERENCE ON MACHINE LEARNING , 1994
"... In the Markov decision process (MDP) formalization of reinforcement learning, a single adaptive agent interacts with an environment defined by a probabilistic transition function. In this solipsistic view, secondary agents can only be part of the environment and are therefore fixed in their behavior ..."
Abstract - Cited by 601 (13 self) - Add to MetaCart
in their behavior. The framework of Markov games allows us to widen this view to include multiple adaptive agents with interacting or competing goals. This paper considers a step in this direction in which exactly two agents with diametrically opposed goals share an environment. It describes a Q

Between MDPs and Semi-MDPs: A Framework for Temporal Abstraction in Reinforcement Learning

by Richard S. Sutton , Doina Precup , Satinder Singh , 1999
"... Learning, planning, and representing knowledge at multiple levels of temporal abstraction are key, longstanding challenges for AI. In this paper we consider how these challenges can be addressed within the mathematical framework of reinforcement learning and Markov decision processes (MDPs). We exte ..."
Abstract - Cited by 569 (38 self) - Add to MetaCart
Learning, planning, and representing knowledge at multiple levels of temporal abstraction are key, longstanding challenges for AI. In this paper we consider how these challenges can be addressed within the mathematical framework of reinforcement learning and Markov decision processes (MDPs). We

A Reliable Multicast Framework for Light-weight Sessions and Application Level Framing

by Sally Floyd, Van Jacobson, Steven McCanne, Ching-gung Liu, Lixia Zhang , 1995
"... This paper... reliable multicast framework for application level framing and light-weight sessions. The algorithms of this framework are efficient, robust, and scale well to both very large networks and very large sessions. The framework has been prototype in wb, a distributed whiteboard application ..."
Abstract - Cited by 1085 (45 self) - Add to MetaCart
This paper... reliable multicast framework for application level framing and light-weight sessions. The algorithms of this framework are efficient, robust, and scale well to both very large networks and very large sessions. The framework has been prototype in wb, a distributed whiteboard

Portholes: Supporting Awareness in a Distributed Work Group

by Paul Dourish - In Proceedings of the Conference on Human Factors in Computing Systems - CHI’92
"... We are investigating ways in which media space technologies can support distributed work groups through access to information that supports general awareness. Awareness involves knowing who is “around”, what activities are cxcurring, who is talking with whom, it provides a view of one another in the ..."
Abstract - Cited by 572 (7 self) - Add to MetaCart
in the daily work environments. Awareness may lead to informal interactions, spontaneous connections, and the development of shared cultures-all important aspects of maintaining working relationships which are denied to groups distributed across multiple sites.

The Aurora Experimental Framework for the Performance Evaluation of Speech Recognition Systems under Noisy Conditions

by David Pearce, Hans-günter Hirsch, Ericsson Eurolab Deutschland Gmbh - in ISCA ITRW ASR2000 , 2000
"... This paper describes a database designed to evaluate the performance of speech recognition algorithms in noisy conditions. The database may either be used to measure frontend feature extraction algorithms, using a defined HMM recognition back-end, or complete recognition systems. The source speech f ..."
Abstract - Cited by 534 (6 self) - Add to MetaCart
was prepared as a contribution to the ETSI STQ-AURORA DSR Working Group[1]. Aurora is developing standards for Distributed Speech Recognition (DSR) where the speech analysis is done in the telecommunication terminal and the recognition at a central location in the telecom network. The framework is currently
Results 1 - 10 of 67,351