Sciweavers

2669 search results - page 130 / 534
» Complex Spatial Relationships
Sort
View
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
15 years 3 months ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
FSTTCS
2004
Springer
15 years 3 months ago
Hardness Hypotheses, Derandomization, and Circuit Complexity
We consider hypotheses about nondeterministic computation that have been studied in different contexts and shown to have interesting consequences: • The measure hypothesis: NP d...
John M. Hitchcock, Aduri Pavan
WEBI
2004
Springer
15 years 3 months ago
An Integrated Approach to Discovery in Complex Information Spaces
As the amount of available data continues to increase, more and more effective means for discovering important patterns and relationships within that data are required. Although t...
Daryl H. Hepting, Cory J. Butz
DAWAK
2010
Springer
14 years 10 months ago
Modelling Complex Data by Learning Which Variable to Construct
Abstract. This paper addresses a task of variable selection which consists in choosing a subset of variables that is sufficient to predict the target label well. Here instead of tr...
Françoise Fessant, Aurélie Le Cam, M...
AAMAS
2011
Springer
14 years 5 months ago
Manipulation complexity and gender neutrality in stable marriage procedures
The stable marriage problem is a well-known problem of matching men to women so that no man and woman who are not married to each other both prefer each other. Such a problem has a...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...