Sciweavers

881 search results - page 48 / 177
» Solving satisfiability problems with preferences
Sort
View
ECCV
2010
Springer
13 years 6 months ago
An Efficient Graph Cut Algorithm for Computer Vision Problems
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
Chetan Arora, Subhashis Banerjee, Prem Kalra, S. N...
ICA
2012
Springer
12 years 4 months ago
Contrast Functions for Independent Subspace Analysis
We consider the Independent Subspace Analysis problem from the point of view of contrast functions, showing that contrast functions are able to partially solve the ISA problem. Tha...
Jason A. Palmer, Scott Makeig
NC
2006
116views Neural Networks» more  NC 2006»
13 years 8 months ago
Automated Design and Programming of a Microfluidic DNA Computer
Previously, we described ways to implement the functions AND and OR in a DNA computer consisting of microreactors with attached heating elements that control annealing of DNA. Base...
Michael S. Livstone, Ron Weiss, Laura F. Landweber
CP
2008
Springer
13 years 10 months ago
A Branch and Bound Algorithm for Numerical MAX-CSP
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
Jean-Marie Normand, Alexandre Goldsztejn, Marc Chr...
ICDT
2005
ACM
128views Database» more  ICDT 2005»
14 years 2 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...