3894 search results - page 429 / 779 » Approximation Algorithms for Biclustering Problems |
248
click to vote
COMPGEOM
2011
ACM
14 years 8 months ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
149
click to vote
FOCS
2003
IEEE
15 years 10 months ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
133
click to vote
ACL
1994
15 years 6 months ago
1994
The computational lexicalization of a grammar is the optimization of the links between lexicalized rules and lexical items in order to improve the quality of the bottom-up filteri...
114
click to vote
ISSAC
2007
Springer
15 years 11 months ago
2007
Springer
In this paper we discuss the use of structured matrix methods for the numerical approximation of the zeros of a univariate polynomial. In particular, it is shown that root-findin...
126
click to vote
HYBRID
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. In this paper, we demonstrate a novel hybrid control synthesis approach using an automotive suspension system. Discrete abstractions are used to approximate the continuou...