357 search results - page 8 / 72 » Is Computational Complexity a Barrier to Manipulation |
155
click to vote
ACSC
2006
IEEE
15 years 11 months ago
2006
IEEE
Manipulating semistructured data, such as XML, does not t well within conventional programming languages. A typical manipulation requires nding all occurrences of a structure matc...
164
click to vote
IPPS
1996
IEEE
15 years 10 months ago
1996
IEEE
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...
278
click to vote
HAPTICS
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper we present a novel approach for simulating the rigid body dynamics of a haptically manipulated object using implicit integration. Our formulation requires the linear...
167
click to vote
PARA
1998
Springer
15 years 10 months ago
1998
Springer
Parallel tools rely on graphical techniques to improve the quality of user interaction. In this paper, we explore how visualization and direct manipulation can be exploited in para...
148
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...