Sciweavers

260 search results - page 21 / 52
» Hardness of Parameterized Resolution
Sort
View
STOC
2012
ACM
196views Algorithms» more  STOC 2012»
11 years 10 months ago
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
Paul Beame, Christopher Beck, Russell Impagliazzo
MST
2007
167views more  MST 2007»
13 years 7 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
TVCG
2012
213views Hardware» more  TVCG 2012»
11 years 10 months ago
Mesh-Driven Vector Field Clustering and Visualization: An Image-Based Approach
—Vector field visualization techniques have evolved very rapidly over the last two decades, however, visualizing vector fields on complex boundary surfaces from computational ...
Zhenmin Peng, Edward Grundy, Robert S. Laramee, Gu...
COLING
1996
13 years 9 months ago
An Underspecified HPSG Representation for Information Structure
hfformation structure can be of great use in linguistic applications, especially in those involving a speech component. However, focus marking by prosody is often ambiguous. Exist...
Jonas Kuhn
CBMS
2006
IEEE
14 years 1 months ago
Real-Time Simulation and Visualization of Subject-Specific 3D Lung Dynamics
In this paper we discuss a framework for modeling the 3D lung dynamics of normal and diseased human subjects and visualizing them using an Augmented Reality (AR) based environment...
Anand P. Santhanam, Cali M. Fidopiastis, Paul Dave...