Results 1 - 10 of 10,392

Exploiting Generative Models in Discriminative Classifiers

by Tommi Jaakkola, David Haussler - In Advances in Neural Information Processing Systems 11 , 1998
"... Generative probability models such as hidden Markov models provide a principled way of treating missing information and dealing with variable length sequences. On the other hand, discriminative methods such as support vector machines enable us to construct flexible decision boundaries and often resu ..."
Abstract - Cited by 551 (9 self) - Add to MetaCart
Generative probability models such as hidden Markov models provide a principled way of treating missing information and dealing with variable length sequences. On the other hand, discriminative methods such as support vector machines enable us to construct flexible decision boundaries and often

A theory of social comparison processes,”

by Leon Festinger - Human Relations, , 1954
"... In this paper we shall present a further development of a previously published theory concerning opinion influence processes in social groups (7). This further development has enabled us to extend the theory to deal with other areas, in addition to opinion formation, in which social comparison is i ..."
Abstract - Cited by 1318 (0 self) - Add to MetaCart
In this paper we shall present a further development of a previously published theory concerning opinion influence processes in social groups (7). This further development has enabled us to extend the theory to deal with other areas, in addition to opinion formation, in which social comparison

Dynamic Tuning of the IEEE 802.11 Protocol to Achieve a Theoretical Throughput Limit

by Frederico Calì, Marco Conti, Enrico Gregori - IEEE/ACM TRANSACTIONS ON NETWORKING , 2000
"... In wireless LANs (WLANs), the medium access control (MAC) protocol is the main element that determines the efficiency in sharing the limited communication bandwidth of the wireless channel. In this paper we focus on the efficiency of the IEEE 802.11 standard for WLANs. Specifically, we analytically ..."
Abstract - Cited by 445 (13 self) - Add to MetaCart
analytically derive the average size of the contention window that maximizes the throughput, hereafter theoretical throughput limit, and we show that: 1) depending on the network configuration, the standard can operate very far from the theoretical throughput limit; and 2) an appropriate tuning of the backoff

Davenport-Schinzel Sequences and Their Geometric Applications

by Pankaj K. Agarwal , Micha Sharir , 1998
"... An (n; s) Davenport-Schinzel sequence, for positive integers n and s, is a sequence composed of n distinct symbols with the properties that no two adjacent elements are equal, and that it does not contain, as a (possibly non-contiguous) subsequence, any alternation a \Delta \Delta \Delta b \Delta \ ..."
Abstract - Cited by 439 (105 self) - Add to MetaCart
of geometric problems can be formulated in terms of lower envelopes. A near-linear bound on the maximum length of Davenport-Schinzel sequences enable us to derive sharp bounds on the combinatorial structure underlying various geometric problems, which in turn yields efficient algorithms for these problems.

The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks

by Christian Bettstetter, Giovanni Resta, Paolo Santi , 2003
"... The random waypoint model is a commonly used mobility model in the simulation of ad hoc networks. It is known that the spatial distribution of network nodes moving according to this model is, in general, nonuniform. However, a closed-form expression of this distribution and an in-depth investigation ..."
Abstract - Cited by 377 (10 self) - Add to MetaCart
of the resulting distribution is the weighted sum of three independent components: the static, pause, and mobility component. This division enables us to understand how the model’s parameters influence the distribution. We derive an exact equation of the asymptotically stationary distribution for movement on a

Gaia: A Middleware Infrastructure to Enable Active Spaces

by Manuel Román, Christopher Hess, Renato Cerqueira, Roy H. Campbell, Klara Nahrstedt - IEEE Pervasive Computing , 2002
"... We envision a future where people’s living spaces are interactive and programmable. Users interact with their offices, homes, cars, malls and airports to request information, benefit from the resources available, and configure the habitat’s behavior. Data and tasks are always accessible and are mapp ..."
Abstract - Cited by 263 (16 self) - Add to MetaCart
properties, and assist in the development and execution of applications. In this article, we present an experimental middleware infrastructure called Gaia that we have used to prototype the resource management of and provide the useroriented interfaces for such physical spaces populated with network-enabled

Unified segmentation

by John Ashburner, Karl J. Friston , 2005
"... A probabilistic framework is presented that enables image registration, tissue classification, and bias correction to be combined within the same generative model. A derivation of a log-likelihood objective function for the unified model is provided. The model is based on a mixture of Gaussians and ..."
Abstract - Cited by 324 (12 self) - Add to MetaCart
A probabilistic framework is presented that enables image registration, tissue classification, and bias correction to be combined within the same generative model. A derivation of a log-likelihood objective function for the unified model is provided. The model is based on a mixture of Gaussians

Chimera: A Virtual Data System For Representing, Querying, and Automating Data Derivation

by Ian Foster, Jens Vöckler, Michael Wilde, Yong Zhao - In Proceedings of the 14th Conference on Scientific and Statistical Database Management , 2002
"... Much scientific data is not obtained from measurements' but rather derived from other data by the application of computational procedures. We hypothesize that explicit representation of these procedures can enable documentation of data provenance, discovery of available methods', and on-de ..."
Abstract - Cited by 282 (28 self) - Add to MetaCart
Much scientific data is not obtained from measurements' but rather derived from other data by the application of computational procedures. We hypothesize that explicit representation of these procedures can enable documentation of data provenance, discovery of available methods', and on

On the Minimum Node Degree and Connectivity of a Wireless Multihop Network

by Christian Bettstetter - ACM MobiHoc , 2002
"... This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k–connectivity. Both topology attributes depend on the spa-tial distribution of the nodes and their transmission range. Using typical modeling assumptions — a random uniform distri ..."
Abstract - Cited by 318 (4 self) - Add to MetaCart
distribution of the nodes and a simple link model — we de-rive an analytical expression that enables the determination of the required range r0 that creates, for a given node den-sity ρ, an almost surely k–connected network. Equivalently, if the maximum r0 of the nodes is given, we can find out how many nodes

ULDBs: Databases with uncertainty and lineage

by Omar Benjelloun, Anish Das Sarma, Alon Halevy, Jennifer Widom - IN VLDB , 2006
"... This paper introduces ULDBs, an extension of relational databases with simple yet expressive constructs for representing and manipulating both lineage and uncertainty. Uncertain data and data lineage are two important areas of data management that have been considered extensively in isolation, howev ..."
Abstract - Cited by 310 (32 self) - Add to MetaCart
notions. With lineage, derived relations are no longer self-contained: their uncertainty depends on uncertainty in the base data. We provide an algorithm for the new operation of extracting a database subset in the presence of interconnected uncertainty. Finally, we show how ULDBs enable a new approach
Results 1 - 10 of 10,392