Sciweavers

855 search results - page 97 / 171
» Complexity of Equations over Sets of Natural Numbers
Sort
View
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
15 years 11 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
16 years 25 days ago
Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
Dániel Marx, Igor Razgon
ICDM
2007
IEEE
137views Data Mining» more  ICDM 2007»
16 years 18 days ago
Locally Constrained Support Vector Clustering
Support vector clustering transforms the data into a high dimensional feature space, where a decision function is computed. In the original space, the function outlines the bounda...
Dragomir Yankov, Eamonn J. Keogh, Kin Fai Kan
CSR
2007
Springer
16 years 13 days ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
MODELS
2009
Springer
15 years 10 months ago
Teaching Modeling: Why, When, What?
This paper reports on a panel discussion held during the Educators’ Symposium at MODELS’2009. It shortly explains the context provided for the discussion and outlines the state...
Jean Bézivin, Robert France, Martin Gogolla...