357 search results - page 17 / 72 » Is Computational Complexity a Barrier to Manipulation |
183
click to vote
ISSAC
2009
Springer
16 years 9 days ago
2009
Springer
Cylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approache...
142
click to vote
ISSAC
2005
Springer
15 years 11 months ago
2005
Springer
This paper describes a method to use compiled, strongly typed Aldor domains in the interpreted, expression-oriented Maple environment. This represents a non-traditional approach t...
157
click to vote
FCS
2006
2006
Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input Sequences
15 years 7 months ago
We have previously developed several algorithms which deal with different input sequence scenarios respectively. In this paper, another sequential algorithm for computing Longest ...
124
click to vote
USITS
2001
15 years 7 months ago
2001
Puppeteer is a system for adapting component-based applications in mobile environments. Puppeteer takes advantage of the exported interfaces of these applications and the structur...
249
click to vote
SIGMOD
2006
ACM
16 years 5 months ago
2006
ACM
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...