2127 search results - page 273 / 426 » Computing large matchings fast |
158
click to vote
JCP
2008
15 years 4 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
142
click to vote
JCC
2002
15 years 4 months ago
2002
: The evaluation of the electron density based similarity function scales quadratically with respect to the size of the molecules for simplified, atomic shell densities. Due to the...
151
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
The scene flow in binocular stereo setup is estimated using a seed growing algorithm. A pair of calibrated and synchronized cameras observe a scene and output a sequence of image...
220
click to vote
ICDE
2003
IEEE
16 years 5 months ago
2003
IEEE
In order to publish a nested XML document from flat relational data, multiple SQL queries are often needed. The efficiency of publishing relies on how fast these queries can be ev...
VLSID
2007
IEEE
16 years 4 months ago
2007
IEEE
State-of-the-art FPGA architectures have millions of gates in CLBs, Block RAMs, and Multiplier blocks which can host fairly large designs. While their physical design calls for oor...