Sciweavers

1024 search results - page 26 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
FOCS
1999
IEEE
15 years 2 months ago
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
Uwe Schöning
CAINE
2001
14 years 11 months ago
Model Reduction Scheme of State-Affine Systems
In this paper, a new method for the approximation of discrete time state-affine systems is proposed. The method is based on the diagonalization of proposed generalized controllabi...
Samir A. Al-Baiyat
CORR
2007
Springer
147views Education» more  CORR 2007»
14 years 9 months ago
Identifying Small Mean Reverting Portfolios
Given multivariate time series, we study the problem of forming portfolios with maximum mean reversion while constraining the number of assets in these portfolios. We show that it...
Alexandre d'Aspremont
TSP
2008
89views more  TSP 2008»
14 years 9 months ago
Noncooperative Eigencoding for MIMO Ad hoc Networks
A new noncooperative eigencoding algorithm is introduced for MIMO Ad hoc networks. The algorithm performs generalized waterfilling with respect to its transmit covariance matrix a...
Duong A. Hoang, Ronald A. Iltis
PODC
2010
ACM
15 years 1 months ago
Brief announcement: on the quest of optimal service ordering in decentralized queries
This paper deals with pipelined queries over services. The execution plan of such queries defines an order in which the services are called. We present the theoretical underpinni...
Efthymia Tsamoura, Anastasios Gounaris, Yannis Man...