Sciweavers

534 search results - page 43 / 107
» Approximation of Indistinct Concepts
Sort
View
SODA
2010
ACM
208views Algorithms» more  SODA 2010»
14 years 5 months ago
Correlation Robust Stochastic Optimization
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...
Shipra Agrawal, Yichuan Ding, Amin Saberi, Yinyu Y...
CINQ
2004
Springer
116views Database» more  CINQ 2004»
13 years 11 months ago
A Survey on Condensed Representations for Frequent Sets
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
Toon Calders, Christophe Rigotti, Jean-Franç...
ICIP
2001
IEEE
14 years 9 months ago
Multiresolution Gaussian mixture models for visual motion estimation
This paper introduces a new generalisation of scale-space and pyramids, which combines statistical modelling with a spatial representation. The representation uses the familiar co...
Roland Wilson, Andrew Calway
DAC
2001
ACM
14 years 8 months ago
Creating and Exploiting Flexibility in Steiner Trees
This paper presents the concept of flexibility ? a geometric property associated with Steiner trees. Flexibility is related to the routability of the Steiner tree. We present an o...
Elaheh Bozorgzadeh, Ryan Kastner, Majid Sarrafzade...
ICCSA
2010
Springer
14 years 2 months ago
String Matching with Mismatches by Real-Valued FFT
String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string ...
Kensuke Baba