3778 search results - page 380 / 756 » Representing Web Graphs |
162
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
228
click to vote
JMLR
2010
15 years 1 months ago
2010
In time series analysis, inference about causeeffect relationships among multiple times series is commonly based on the concept of Granger causality, which exploits temporal struc...
297
click to vote
MST
2011
14 years 9 months ago
2011
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...
221
click to vote
SCFBM
2008
15 years 6 months ago
2008
: FASH (Fourier Alignment Sequence Heuristics) is a web application, based on the Fast Fourier Transform, for finding remote homologs within a long nucleic acid sequence. Given a ...
143
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
Traditional clustering algorithms work on "flat" data, making the assumption that the data instances can only be represented by a set of homogeneous and uniform features...