Sciweavers

3946 search results - page 170 / 790
» The computational complexity of choice sets
Sort
View
CVPR
1998
IEEE
16 years 8 months ago
A Methodology for Deriving Probabilistic Correctness Measures from Recognizers
This paper describes the derivation of probability of correctness from scores assigned by most recognizers. Motivation for this research is three-fold: i probability values can be...
Djamel Bouchaffra, Venu Govindaraju, Sargur N. Sri...
GEOINFORMATICA
1998
96views more  GEOINFORMATICA 1998»
15 years 6 months ago
Experiments with Learning Techniques for Spatial Model Enrichment and Line Generalization
The nature of map generalization may be non-uniform along the length of an individual line, requiring the application of methods that adapt to the local geometry and the geographi...
Corinne Plazanet, Nara Martini Bigolin, Anne Ruas
AMAST
2006
Springer
15 years 10 months ago
Some Programming Languages for Logspace and Ptime
We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization ...
Guillaume Bonfante
ICDE
1998
IEEE
153views Database» more  ICDE 1998»
16 years 8 months ago
Flattening an Object Algebra to Provide Performance
Algebraic transformation and optimization techniques have been the method of choice in relational query execution, but applying them in OODBMS is difficult due to the complexity o...
Peter A. Boncz, Annita N. Wilschut, Martin L. Kers...
ICWE
2007
Springer
16 years 22 days ago
The Use of a Bayesian Network for Web Effort Estimation
The objective of this paper is to describe the use of a probabilistic approach to Web effort estimation by means of a Bayesian Network. A Bayesian Network is a model that embodies ...
Emilia Mendes