400 search results - page 73 / 80 » What Makes a Problem GP-Hard |
SPAA
2004
ACM
14 years 24 days ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
VRCAI
2004
ACM
14 years 24 days ago
2004
ACM
Despite steady research advances in many aspects of virtual reality, building and testing virtual worlds remains to be a very difficult process. Most virtual environments are stil...
ELPUB
2003
ACM
14 years 19 days ago
2003
ACM
Electronic publishing constitutes one of the most exciting themes nowadays, amongst academics, at least, though substantial effects of IT usage for communication purposes in other...
SIGMETRICS
2003
ACM
14 years 19 days ago
2003
ACM
It is commonly agreed that scheduling mechanisms in general purpose operating systems do not provide adequate support for modern interactive applications, notably multimedia appli...
DAGM
2003
Springer
14 years 18 days ago
2003
Springer
We provide an overview of spline and wavelet techniques with an emphasis on applications in pattern recognition. The presentation is divided in three parts. In the first one, we ar...