Sciweavers

555 search results - page 40 / 111
» Decompositions of Grammar Constraints
Sort
View
112
Voted
IJCV
2000
133views more  IJCV 2000»
15 years 14 days ago
Heteroscedastic Regression in Computer Vision: Problems with Bilinear Constraint
We present an algorithm to estimate the parameters of a linear model in the presence of heteroscedastic noise, i.e., each data point having a different covariance matrix. The algor...
Yoram Leedan, Peter Meer
92
Voted
SIAMJO
2010
47views more  SIAMJO 2010»
14 years 7 months ago
Integer Programming Subject to Monomial Constraints
Abstract. We investigate integer programs containing monomial constraints of the type Q iI xi i = b. Due to the number-theoretic nature of these constraints, standard methods based...
Christoph Buchheim, Dennis Michaels, Robert Weisma...
113
Voted
CSCLP
2005
Springer
15 years 6 months ago
Complete Propagation Rules for Lexicographic Order Constraints over Arbitrary Domains
We give an efficiently executable specification of the global constraint of lexicographic order in the Constraint Handling Rules (CHR) language. In contrast to previous approaches...
Thom W. Frühwirth
103
Voted
CORR
2004
Springer
152views Education» more  CORR 2004»
15 years 15 days ago
Non-negative matrix factorization with sparseness constraints
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been a...
Patrik O. Hoyer
131
Voted
ATAL
2011
Springer
14 years 19 days ago
Decomposing constraint systems: equivalences and computational properties
Distributed systems can often be modeled as a collection of distributed (system) variables whose values are constrained by a set of constraints. In distributed multi-agent systems...
Wiebe van der Hoek, Cees Witteveen, Michael Wooldr...