Sciweavers

2412 search results - page 446 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
WSE
2006
IEEE
14 years 1 months ago
Modeling Request Routing in Web Applications
For web applications, determining how requests from a web page are routed through server components can be time-consuming and error-prone due to the complex set of rules and mecha...
Minmin Han, Christine Hofmeister
ECAI
2000
Springer
13 years 12 months ago
Autosteve: Automated Electrical Design Analysis
AutoSteve performs automated electrical design based on qualitative simulation and functional abstraction. It is the first commercial product capable of performing these tasks for ...
Chris Price
CA
1999
IEEE
13 years 12 months ago
Collaborative Animation over the Network
The continuously increasing complexity of computer animationsmakes it necessary to rely on the knowledge of various experts to cover the different areas of computer graphics and a...
François Faure, Chris Faisstnauer, Gerd Hes...
VISUALIZATION
1998
IEEE
13 years 12 months ago
A general method for preserving attribute values on simplified meshes
Many sophisticated solutions have been proposed to reduce the geometric complexity of 3D meshes. A less studied problem is how to preserve on a simplified mesh the detail (e.g. co...
Paolo Cignoni, Claudio Montani, Roberto Scopigno, ...
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 8 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...