Sciweavers

2370 search results - page 86 / 474
» A Structured Set of Higher-Order Problems
Sort
View
ATAL
2009
Springer
14 years 3 months ago
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
Tammar Shrot, Yonatan Aumann, Sarit Kraus
FOCS
2005
IEEE
14 years 2 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
ECCV
2002
Springer
14 years 11 months ago
Tracking and Rendering Using Dynamic Textures on Geometric Structure from Motion
Estimating geometric structure from uncalibrated images accurately enough for high quality rendering is difficult. We present a method where only coarse geometric structure is trac...
Dana Cobzas, Martin Jägersand
COMPGEOM
2003
ACM
14 years 2 months ago
The smallest enclosing ball of balls: combinatorial structure and algorithms
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
Kaspar Fischer, Bernd Gärtner
ESANN
2004
13 years 10 months ago
Neural networks for data mining: constrains and open problems
When we talk about using neural networks for data mining we have in mind the original data mining scope and challenge. How did neural networks meet this challenge? Can we run neura...
Razvan Andonie, Boris Kovalerchuk