Sciweavers

466 search results - page 3 / 94
» Algebraic Structures and Algorithms for Matching and Matroid...
Sort
View
JCO
2008
102views more  JCO 2008»
13 years 8 months ago
Stable matching problems with exchange restrictions
We study variants of classical stable matching problems in which there is an additional requirement for a stable matching, namely that there should not be two participants who wou...
Robert W. Irving
COMPGEOM
2001
ACM
14 years 5 days ago
Segment intersection searching problems in general settings
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
Vladlen Koltun
NIPS
2008
13 years 10 months ago
Predicting the Geometry of Metal Binding Sites from Protein Sequence
Metal binding is important for the structural and functional characterization of proteins. Previous prediction efforts have only focused on bonding state, i.e. deciding which prot...
Paolo Frasconi, Andrea Passerini
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
14 years 3 months ago
Iterative Rounding for Multi-Objective Optimization Problems
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
Fabrizio Grandoni, R. Ravi, Mohit Singh
ECSQARU
2007
Springer
14 years 2 months ago
Algebraic Structures for Bipolar Constraint-Based Reasoning
The representation of both scales of cost and scales of benefit is very natural in a decision-making problem: scales of evaluation of decisions are often bipolar. The aim of this ...
Hélène Fargier, Nic Wilson