Sciweavers

1561 search results - page 195 / 313
» Probability Theory on IF Events
Sort
View
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 12 months ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
Gregory Valiant, Tim Roughgarden
ICMCS
2005
IEEE
123views Multimedia» more  ICMCS 2005»
15 years 11 months ago
Hidden Markov Model Based Weighted Likelihood Discriminant for Minimum Error Shape Classification
The goal of this communication is to present a weighted likelihood discriminant for minimum error shape classification. Different from traditional Maximum Likelihood (ML) methods...
Ninad Thakoor, Sungyong Jung, Jean Gao
MSWIM
2004
ACM
15 years 11 months ago
Quantile models for the threshold range for k-connectivity
This study addresses the problem of k-connectivity of a wireless multihop network consisting of randomly placed nodes with a common transmission range, by utilizing empirical regr...
Henri Koskinen
PODS
2010
ACM
207views Database» more  PODS 2010»
15 years 11 months ago
Understanding cardinality estimation using entropy maximization
Cardinality estimation is the problem of estimating the number of tuples returned by a query; it is a fundamentally important task in data management, used in query optimization, ...
Christopher Ré, Dan Suciu
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
15 years 10 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic