Sciweavers

11740 search results - page 199 / 2348
» More Problems in Rewriting
Sort
View
JCSS
2010
112views more  JCSS 2010»
15 years 2 months ago
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
Nadja Betzler, Britta Dorn
JDA
2010
88views more  JDA 2010»
15 years 2 months ago
Greedy colorings for the binary paintshop problem
Cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color chan...
Hadis Amini, Frédéric Meunier, H&eac...
ECCV
2010
Springer
15 years 1 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...
SIAMMA
2010
97views more  SIAMMA 2010»
14 years 11 months ago
Small Volume Fraction Limit of the Diblock Copolymer Problem: I. Sharp-Interface Functional
We present the first of two articles on the small volume fraction limit of a nonlocal Cahn-Hilliard functional introduced to model microphase separation of diblock copolymers. Her...
Rustum Choksi, Mark A. Peletier
VLUDS
2010
212views Visualization» more  VLUDS 2010»
14 years 11 months ago
Open Problems in Computational Steering of Massive Parallel Unstructured Grid Based CFD Simulations
Traditionally, analysis of flow fields resulting from computational fluid dynamics (CFD) calculations is a sequential process. The flow area defined by surrounding geometry is tes...
Christian Wagner