Sciweavers

4524 search results - page 118 / 905
» The Complexity of Global Constraints
Sort
View
SIGECOM
2011
ACM
229views ECommerce» more  SIGECOM 2011»
14 years 3 months ago
A revealed preference approach to computational complexity in economics
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
Federico Echenique, Daniel Golovin, Adam Wierman
107
Voted
HPCC
2007
Springer
15 years 6 months ago
Towards a Complexity Model for Design and Analysis of PGAS-Based Algorithms
Many new Partitioned Global Address Space (PGAS) programming languages have recently emerged and are becoming ubiquitously available on nearly all modern parallel architectures. PG...
Mohamed Bakhouya, Jaafar Gaber, Tarek A. El-Ghazaw...
95
Voted
CVPR
2008
IEEE
16 years 2 months ago
Modeling complex luminance variations for target tracking
Lambert's model is widely used in low level computer vision algorithms such as matching, tracking or optical flow computation for example. However, it is well known that thes...
Éric Marchand, Christophe Collewet
137
Voted
CGF
2011
14 years 4 months ago
Global Structure Optimization of Quadrilateral Meshes
We introduce a fully automatic algorithm which optimizes the high-level structure of a given quadrilateral mesh to achieve a coarser quadrangular base complex. Such a topological ...
David Bommes, Timm Lempfer, Leif Kobbelt
NIPS
2008
15 years 2 months ago
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
Sham M. Kakade, Karthik Sridharan, Ambuj Tewari