6110 search results - page 150 / 1222 » Approximate Computing |
193
click to vote
JMLR
2010
15 years 4 months ago
2010
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
189
click to vote
WADS
2005
Springer
15 years 12 months ago
2005
Springer
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for â...
153
click to vote
SCL
2010
15 years 4 months ago
2010
In this paper we show that incrementally stable nonlinear time–delay systems admit symbolic models which are approximately equivalent, in the sense of approximate bisimulation, ...
184
click to vote
AINA
2009
IEEE
15 years 4 months ago
2009
IEEE
Determining the time and means by which to travel from location A to location B for a person utilising a MANET requires the dissemination of both realtime and historic data. In thi...
179
click to vote
SODA
1998
ACM
15 years 7 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...