2374 search results - page 207 / 475 » Fast Distributed Algorithms for Computing Separable Function... |
134
click to vote
COMGEO
2004
ACM
15 years 2 months ago
2004
ACM
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
111
click to vote
VLSID
2008
IEEE
16 years 3 months ago
2008
IEEE
We present a discrete-time time-domain vector fitting algorithm, called TD-VFz, for rational function macromodeling of port-to-port responses with discrete time-sampled data. The ...
135
click to vote
APPROX
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
111
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
We pose the recognition problem as data association. In this setting, a novel object is explained solely in terms of a small set of exemplar objects to which it is visually simila...
150
click to vote
BMCBI
2006
15 years 3 months ago
2006
Background: The modeling of dynamic systems requires estimating kinetic parameters from experimentally measured time-courses. Conventional global optimization methods used for par...