2430 search results - page 346 / 486 » Computing Tutte Polynomials |
129
click to vote
APPROX
2005
Springer
15 years 9 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
145
click to vote
IDEAS
2003
IEEE
15 years 8 months ago
2003
IEEE
The objective of this paper is to investigate the problems related to the extensional integration of information sources. In particular, we propose an approach for managing incons...
157
click to vote
SIGMOD
2010
ACM
15 years 8 months ago
2010
ACM
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
155
click to vote
EUROCRYPT
2010
Springer
15 years 8 months ago
2010
Springer
In this paper we propose a new approach to investigate the security of the McEliece cryptosystem. We recall that this cryposystem relies on the use of error-correcting codes. Since...
150
click to vote
KR
2010
Springer
15 years 8 months ago
2010
Springer
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive power and computational complexity and, more spec...