1346 search results - page 33 / 270 » Algorithmic Search for Flexibility Using Resultants of Polyn... |
HYBRID
2007
Springer
14 years 1 months ago
2007
Springer
We provide an asymptotically tight, computationally efficient approximation of the joint spectral radius of a set of matrices using sum of squares (SOS) programming. The approach i...
ICWS
2008
IEEE
13 years 9 months ago
2008
IEEE
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
VLDB
1997
ACM
13 years 11 months ago
1997
ACM
Efficient user-adaptable similarity search more and more increases in its importance for multimedia and spatial database systems. As a general similarity model for multi-dimension...
OPODIS
2003
13 years 9 months ago
2003
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
MATES
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Searching for information in large rather unstructured realworld data sets is a di cult task, because the user expects immediate responses as well as high-quality search ...