Sciweavers

1322 search results - page 106 / 265
» Parameterized counting problems
Sort
View
AUTOMATICA
2007
61views more  AUTOMATICA 2007»
13 years 9 months ago
Errors-in-variables methods in system identification
Abstract: The paper gives a survey of errors-in-variables methods in system identification. Background and motivation are given, and examples illustrate why the identification pr...
Torsten Söderström
JUCS
2008
135views more  JUCS 2008»
13 years 9 months ago
Approximation to a Behavioral Model for Estimating Traffic Aggregation Scenarios
: This article provides a comparison among different methods for estimating the aggregation of Internet traffic resulting from different users, network-access types and correspondi...
Alberto E. Garcia, Klaus D. Hackbarth
CP
2005
Springer
14 years 2 months ago
Incremental Algorithms for Local Search from Existential Second-Order Logic
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
Magnus Ågren, Pierre Flener, Justin Pearson
PKC
2001
Springer
111views Cryptology» more  PKC 2001»
14 years 1 months ago
Cryptanalysis of PKP: A New Approach
Quite recently, in [4], a new time-memory tradeoff algorithm was presented. The original goal of this algorithm was to count the number of points on an elliptic curve, however, th...
Éliane Jaulmes, Antoine Joux
COLING
2008
13 years 10 months ago
An Improved Hierarchical Bayesian Model of Language for Document Classification
This paper addresses the fundamental problem of document classification, and we focus attention on classification problems where the classes are mutually exclusive. In the course ...
Ben Allison