Sciweavers

4940 search results - page 178 / 988
» On the Complexity of Universal Programs
Sort
View
MICCAI
2004
Springer
16 years 7 months ago
An Event-Driven Framework for the Simulation of Complex Surgical Procedures
Existing surgical simulators provide a physical simulation that can help a trainee develop the hand-eye coordination and motor skills necessary for specific tasks, such as cutting ...
Christopher Sewell, Dan Morris, Nikolas H. Blevins...
ICALP
2005
Springer
16 years 15 days ago
On Dynamic Bit-Probe Complexity
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
Corina E. Patrascu, Mihai Patrascu
201
Voted
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
16 years 13 days ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
175
Voted
ASPDAC
2004
ACM
97views Hardware» more  ASPDAC 2004»
16 years 13 days ago
Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost
As gate delays decrease faster than wire delays for each technology generation, buffer insertion becomes a popular method to reduce the interconnect delay. Several modern buffer in...
Weiping Shi, Zhuo Li, Charles J. Alpert
ICALP
2003
Springer
16 years 6 days ago
A Direct Sum Theorem in Communication Complexity via Message Compression
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen