Sciweavers

4084 search results - page 263 / 817
» Constraints in spatial structures
Sort
View
RAS
2007
115views more  RAS 2007»
15 years 6 months ago
A variational method for the recovery of dense 3D structure from motion
The purpose of this study is to investigate a variational formulation of the problem of three-dimensional (3D) interpretation of temporal image sequences based on the 3D brightnes...
Hicham Sekkati, Amar Mitiche
SAGT
2010
Springer
200views Game Theory» more  SAGT 2010»
15 years 5 months ago
2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
Vijay V. Vazirani
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
16 years 8 months ago
Fast Identification of Relational Constraint Violations
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
Amit Chandel, Nick Koudas, Ken Q. Pu, Divesh Sriva...
ECCV
2010
Springer
16 years 18 days ago
Maximum Margin Distance Learning for Dynamic Texture Recognition
The range space of dynamic textures spans spatiotemporal phenomena that vary along three fundamental dimensions: spatial texture, spatial texture layout, and dynamics. By describin...
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
15 years 7 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...