Sciweavers

1333 search results - page 189 / 267
» Not a Number of Floating Point Problems
Sort
View
SMA
2010
ACM
160views Solid Modeling» more  SMA 2010»
15 years 2 months ago
A geostatistical approach to define guidelines for radon prone area identification
Radon is a natural radioactive gas known to be the main contributor to natural background radiation exposure and the major leading cause of lung cancer second to smoking. Indoor ra...
Riccardo Borgoni, Piero Quatto, Giorgio Somà...
FOCS
2008
IEEE
15 years 10 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
CVIU
2011
14 years 7 months ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...
STACS
2005
Springer
15 years 9 months ago
Algorithmics in Exponential Time
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
Uwe Schöning
AI
2010
Springer
15 years 4 months ago
Kernel functions for case-based planning
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
Ivan Serina