Sciweavers

3946 search results - page 325 / 790
» The computational complexity of choice sets
Sort
View
ICIP
2005
IEEE
16 years 8 months ago
Threshold dynamics for shape reconstruction and disocclusion
We propose a very efficient numerical algorithm for minimizing certain curvature dependent functionals that appear in a variety of well known variational models of image processin...
Selim Esedoglu, Steven J. Ruuth, Richard Tsai
CHI
2002
ACM
16 years 7 months ago
Applying patterns of cooperative interaction to work (re)design: e-government and planning
This paper presents patterns of cooperative interaction derived from ethnographic studies of cooperative work as devices for generalisation, re-use and design. These patterns cons...
David Martin, Mark Rouncefield, Ian Sommerville
STACS
2010
Springer
16 years 1 months ago
Treewidth Reduction for Constrained Separation and Bipartization Problems
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
Dániel Marx, Barry O'Sullivan, Igor Razgon
FOCS
2009
IEEE
16 years 1 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...
ICPR
2008
IEEE
16 years 1 months ago
Automatic generation of optimum classification cascades
In this paper, we present a novel technique to automatically generate optimum classification cascades. Given a powerful classifier SF with satisfactory accuracy and a set of N cla...
Ezzat Ali El-Sherif, Sherif Abdelazeem, M. Fathy A...