Sciweavers

189 search results - page 21 / 38
» SCARAB: scaling reachability computation on large graphs
Sort
View
BICOB
2009
Springer
15 years 4 months ago
Assembly of Large Genomes from Paired Short Reads
The de novo assembly of genomes from high-throughput short reads is an active area of research. Several promising methods have been recently developed, with applicability mainly re...
Benjamin G. Jackson, Patrick S. Schnable, Srinivas...
59
Voted
DAC
2009
ACM
15 years 10 months ago
Low power gated bus synthesis using shortest-path Steiner graph for system-on-chip communications
Power consumption of system-level on-chip communications is becoming more significant in the overall system-on-chip (SoC) power as technology scales down. In this paper, we propos...
Renshen Wang, Nan-Chi Chou, Bill Salefski, Chung-K...
ICCV
2011
IEEE
13 years 9 months ago
Double Window Optimisation for Constant Time Visual SLAM
We present a novel and general optimisation framework for visual SLAM, which scales for both local, highly accurate reconstruction and large-scale motion with long loop closures. ...
Hauke Strasdat, Andrew J. Davison, J. M. M. Montie...
CIKM
2009
Springer
15 years 4 months ago
Networks, communities and kronecker products
Emergence of the web and online computing applications gave rise to rich large scale social activity data. One of the principal challenges then is to build models and understandin...
Jure Leskovec
IPPS
1998
IEEE
15 years 1 months ago
Benchmarking the Task Graph Scheduling Algorithms
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
Yu-Kwong Kwok, Ishfaq Ahmad