534 search results - page 20 / 107 » Approximation of Indistinct Concepts |
WSCG
2003
13 years 9 months ago
2003
The problem of styling surfaces modeling is tackled. An approach based on section curves fairing is chosen. The concept of template curves is developed for approximating profiles ...
COOPIS
2004
IEEE
13 years 11 months ago
2004
IEEE
Querying and integrating sources of structured data from the Web in most cases requires similarity-based concepts to deal with data level conflicts. This is due to the often errone...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
AAAI
2010
13 years 7 months ago
2010
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
SIAMCOMP
1998
13 years 7 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...