Sciweavers

5785 search results - page 13 / 1157
» Approximability of Probability Distributions
Sort
View
ENTCS
2007
85views more  ENTCS 2007»
14 years 11 months ago
Proving Approximate Implementations for Probabilistic I/O Automata
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task str...
Sayan Mitra, Nancy A. Lynch
ICPR
2008
IEEE
16 years 27 days ago
Structural poisson mixtures for classification of documents
Considering the statistical text classification problem we approximate class-conditional probability distributions by structurally modified Poisson mixtures. By introducing the st...
Jana Novovicová, Jiri Grim, Petr Somol
INFOCOM
2007
IEEE
15 years 6 months ago
Service Time Approximation in IEEE 802.11 Single-Hop Ad-hoc Networks
Abstract— This paper investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets succes...
Atef Abdrabou, Weihua Zhuang
PODS
2007
ACM
203views Database» more  PODS 2007»
15 years 12 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
SSPR
2000
Springer
15 years 3 months ago
A New Approximation Method of the Quadratic Discriminant Function
Abstract. For many statistical pattern recognition methods, distributions of sample vectors are assumed to be normal, and the quadratic discriminant function derived from the proba...
Shinichiro Omachi, Fang Sun, Hirotomo Aso