• 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 4,214
Next 10 →

Processing data-stream join aggregates using skimmed sketches

by Sumit Ganguly, Minos Garofalakis, Rajeev Rastogi - In Proc. Int. Conf. on Extending Database Technology (EDBT , 2004
"... sganguly,minos,rastogi¡ Abstract. There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amount of memory. Providing (perhaps approximate) answers to aggregate queries over such ..."
Abstract - Cited by 23 (4 self) - Add to MetaCart
. Our skimmed-sketch technique achieves all of the above by first skimming the dense frequencies from random hash-sketch summaries of the two streams. It then computes the subjoin size involving only dense frequencies directly, and uses the skimmed sketches only to approximate subjoin sizes for the non

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
line segment and an accurate approximation for a square area. The good quality of this approximation is validated through simulations using various settings of the mobility parameters. In summary, this article gives a fundamental understanding of the behavior of the random waypoint model.

FUTURE PATHS FOR INTEGER PROGRAMMING AND LINKS TO Artificial Intelligence

by Fred Glover , 1986
"... Scope and Purpose-A summary is provided of some of the recent (and a few not-so-recent) developments that otTer promise for enhancing our ability to solve combinatorial optimization problems. These developments may be usefully viewed as a synthesis of the perspectives of operations research and arti ..."
Abstract - Cited by 379 (8 self) - Add to MetaCart
Scope and Purpose-A summary is provided of some of the recent (and a few not-so-recent) developments that otTer promise for enhancing our ability to solve combinatorial optimization problems. These developments may be usefully viewed as a synthesis of the perspectives of operations research

Summarizing Text Documents: Sentence Selection and Evaluation Metrics

by Jade Goldstein, Mark Kantrowitz, Vibhu Mittal, Jaime Carbonell - In Research and Development in Information Retrieval , 1999
"... Human-quality text summarization systems are difficult to design, and even more difficult to evaluate, in part because documents can differ along several dimensions, such as length, writing style and lexical usage. Nevertheless, certain cues can often help suggest the selection of sentences for incl ..."
Abstract - Cited by 236 (7 self) - Add to MetaCart
. The potential linguistic ones were derived from an analysis of news-wire summaries. Toevaluate these features we use a normalized version of precision-recall curves, with a baseline of random sentence selection, as well as analyze the properties of such a baseline. We illustrate our discussions with empirical

An introduction to exponential random graph (p*) models for social networks.

by Garry Robins , Pip Pattison , Yuval Kalish , Dean Lusher - Social Networks, , 2007
"... Abstract This article provides an introductory summary to the formulation and application of exponential random graph models for social networks. The possible ties among nodes of a network are regarded as random variables, and assumptions about dependencies among these random tie variables determin ..."
Abstract - Cited by 195 (4 self) - Add to MetaCart
Abstract This article provides an introductory summary to the formulation and application of exponential random graph models for social networks. The possible ties among nodes of a network are regarded as random variables, and assumptions about dependencies among these random tie variables

Bayesian phylogenetic inference via Markov chain Monte Carlo methods

by Bob Mau, Li Michael A, Bret Larget - Biometrics , 1999
"... SUMMARY. We derive a Markov chain to sample from the posterior distribution for a phylogenetic tree given sequence information from the corresponding set of organisms, a stochastic model for these data, and a prior distribution on the space of trees. A transformation of the tree into a canonical cop ..."
Abstract - Cited by 159 (6 self) - Add to MetaCart
SUMMARY. We derive a Markov chain to sample from the posterior distribution for a phylogenetic tree given sequence information from the corresponding set of organisms, a stochastic model for these data, and a prior distribution on the space of trees. A transformation of the tree into a canonical

Summary

by Saila Torvinen, Pekka Kannus, Harri Sievaènen, Tero A. H. Jaèrvinen, Matti Pasanen, Saija Kontulainen, Markku Jaèrvinen, Pekka Oja, Ilkka Vuori, Saila Torvinen Md , 2001
"... Randomized cross-over study ..."
Abstract - Add to MetaCart
Randomized cross-over study

SUMMARY

by R. Cottereau, John Wiley , 2013
"... Numerical strategy for unbiased homogenization of random ..."
Abstract - Add to MetaCart
Numerical strategy for unbiased homogenization of random

SUMMARY

by Devrim Emrah Ayymldmz, Hakan Delii
"... Adaptive random access algorithm with improved delay performance ..."
Abstract - Add to MetaCart
Adaptive random access algorithm with improved delay performance

SUMMARY

by Michael L. Pennell, David B. Dunson
"... Fitting semiparametric random effects models to large data sets ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Fitting semiparametric random effects models to large data sets
Next 10 →
Results 1 - 10 of 4,214
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