Sciweavers

1998 search results - page 98 / 400
» Complexity of the Cover Polynomial
Sort
View
TIT
1998
63views more  TIT 1998»
15 years 4 months ago
On the Consistency of Minimum Complexity Nonparametric Estimation
— Nonparametric estimation is usually inconsistent without some form of regularization. One way to impose regularity is through a prior measure. Barron and Cover [1], [2] have sh...
Zhiyi Chi, Stuart Geman
123
Voted
ICST
2008
IEEE
15 years 11 months ago
Efficient Test Data Generation for Variables with Complex Dependencies
This paper introduces a new method for generating test data that combines the benefits of equivalence partitioning, boundary value analysis and cause-effect analysis. It is suitab...
Armin Beer, Stefan Mohacsi
WADS
2007
Springer
115views Algorithms» more  WADS 2007»
15 years 11 months ago
Alpha-Beta Witness Complexes
Building on the work of Martinetz, Schulten and de Silva, Carlsson, we introduce a 2-parameter family of witness complexes and algorithms for constructing them. This family can be ...
Dominique Attali, Herbert Edelsbrunner, John Harer...
PATMOS
2004
Springer
15 years 10 months ago
Application Analysis with Integrated Identification of Complex Instructions for Configurable Processors
Abstract. An extensible and configurable processor is a programmable platform offering the possibility to customize the instruction set and/or underlying microarchitecture. Efficie...
Nikolaos Kavvadias, Spiridon Nikolaidis
LOCWEB
2009
ACM
15 years 9 months ago
Hiding the complexity of LBS
While the demand for Location-based Services (LBS) is strongly increasing, technical laymen are not yet able to build and provide location-aware applications. This paper presents ...
Matthias Böhmer, Gernot Bauer, Wolfgang Wicht