Sciweavers

659 search results - page 59 / 132
» Dynamic Algorithms for Graph Spanners
Sort
View
FCCM
2008
IEEE
176views VLSI» more  FCCM 2008»
13 years 7 months ago
The Effectiveness of Configuration Merging in Point-to-Point Networks for Module-based FPGA Reconfiguration
Communications infrastructure for modular reconfiguration of FPGAs needs to support the changing communications interfaces of a sequence of modules. In order to avoid the overhead...
Shannon Koh, Oliver Diessel
ICASSP
2008
IEEE
14 years 2 months ago
Symbol graph based discriminative training and rescoring for improved math symbol recognition
In the symbol recognition stage of online handwritten math expression recognition, the one-pass dynamic programming algorithm can produce high-quality symbol graphs in addition of...
Zhen Xuan Luo, Yu Shi, Frank K. Soong
VLDB
2000
ACM
125views Database» more  VLDB 2000»
13 years 11 months ago
Focused Crawling Using Context Graphs
Maintaining currency of search engine indices by exhaustive crawling is rapidly becoming impossible due to the increasing size and dynamic content of the web. Focused crawlers aim...
Michelangelo Diligenti, Frans Coetzee, Steve Lawre...
AAAI
2007
13 years 10 months ago
Dynamic DFS Tree in ADOPT-ing
Several distributed constraint reasoning algorithms employ Depth First Search (DFS) trees on the constraint graph that spans involved agents. In this article we show that it is po...
Marius-Calin Silaghi, Makoto Yokoo
IPPS
2007
IEEE
14 years 1 months ago
A Multi-Level Parallel Implementation of a Program for Finding Frequent Patterns in a Large Sparse Graph
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
Steve Reinhardt, George Karypis