Sciweavers

400 search results - page 73 / 80
» What Makes a Problem GP-Hard
Sort
View
149
Voted
SPAA
2004
ACM
15 years 9 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
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...
Gary L. Miller, Peter C. Richter
140
Voted
VRCAI
2004
ACM
15 years 9 months ago
Explorative construction of virtual worlds: an interactive kernel approach
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...
Jinseok Seo, Gerard Jounghyun Kim
152
Voted
ELPUB
2003
ACM
15 years 9 months ago
The Diversity of Trends, Experiences and Approaches in Electronic Publishing: Evidences of a Paradigm Shift on Communication
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...
Sely Maria de Souza Costa, Ana Cristina Moreira
119
Voted
SIGMETRICS
2003
ACM
101views Hardware» more  SIGMETRICS 2003»
15 years 9 months ago
Effects of clock resolution on the scheduling of interactive and soft real-time processes
It is commonly agreed that scheduling mechanisms in general purpose operating systems do not provide adequate support for modern interactive applications, notably multimedia appli...
Yoav Etsion, Dan Tsafrir, Dror G. Feitelson
146
Voted
DAGM
2003
Springer
15 years 9 months ago
Splines and Wavelets: New Perspectives for Pattern Recognition
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...
Michael Unser