3875 search results - page 312 / 775 » Approximation algorithms for the 0-extension problem |
183
click to vote
SIBGRAPI
2005
IEEE
16 years 11 days ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
137
click to vote
GECCO
2005
Springer
16 years 9 days ago
2005
Springer
To obtain the expertise to correctly perform minimally– invasive vascular interventions thorough training is required. Training using simulation systems are increasingly becomin...
175
click to vote
CGVR
2006
15 years 8 months ago
2006
The computation of soft shadows created by area light sources is a well-known problem in computer graphics. Due to the complexity of the problem, soft shadows commonly are generat...
164
click to vote
ICALP
2004
Springer
16 years 5 days ago
2004
Springer
In the information age, the availability of data on consumer profiles has opened new possibilities for companies to increase their revenue via data mining techniques. One approach...
179
click to vote
JAIR
2010
15 years 5 months ago
2010
Domain-specific features are important in representing problem structure throughout machine learning and decision-theoretic planning. In planning, once state features are provide...