Sciweavers

1359 search results - page 165 / 272
» Probabilistic Points-to Analysis
Sort
View
ISDA
2008
IEEE
15 years 4 months ago
Performance Comparison of ADRS and PCA as a Preprocessor to ANN for Data Mining
In this paper we compared the performance of the Automatic Data Reduction System (ADRS) and principal component analysis (PCA) as a preprocessor to artificial neural networks (ANN...
Nicholas Navaroli, David Turner, Arturo I. Concepc...
PRDC
2008
IEEE
15 years 4 months ago
On the Complexity of a Self-Stabilizing Spanning Tree Algorithm for Large Scale Systems
Many large scale systems, like grids and structured peer to peer systems, operate on a constrained topology. Since underlying networks do not expose the real topology to the appli...
Julien Clement, Thomas Hérault, Stép...
ECSQARU
2007
Springer
15 years 4 months ago
Interpreting Belief Functions as Dirichlet Distributions
Traditional Dempster Shafer belief theory does not provide a simple method for judging the effect of statistical and probabilistic data on belief functions and vice versa. This put...
Audun Jøsang, Zied Elouedi
IBPRIA
2003
Springer
15 years 3 months ago
Smoothing Techniques for Tree-k-Grammar-Based Natural Language Modeling
Abstract. In a previous work, a new probabilistic context-free grammar (PCFG) model for natural language parsing derived from a tree bank corpus has been introduced. The model esti...
Jose L. Verdú-Mas, Jorge Calera-Rubio, Rafa...
ICALP
2001
Springer
15 years 2 months ago
Improved Lower Bounds on the Randomized Complexity of Graph Properties
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
Amit Chakrabarti, Subhash Khot