Sciweavers

2294 search results - page 91 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
ICRA
2009
IEEE
107views Robotics» more  ICRA 2009»
15 years 4 months ago
Graph-based planning using local information for unknown outdoor environments
— One of the common applications for outdoor robots is to follow a path in large scale unknown environments. This task is challenging due to the intensive memory requirements to ...
Jinhan Lee, Roozbeh Mottaghi, Charles Pippin, Tuck...
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
15 years 10 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
IACR
2011
104views more  IACR 2011»
13 years 9 months ago
Short Transitive Signatures for Directed Trees
A transitive signature scheme allows to sign a graph in such a way that, given the signatures of edges (a, b) and (b, c), it is possible to compute the signature for the edge (or ...
Philippe Camacho, Alejandro Hevia
SPAA
2003
ACM
15 years 3 months ago
Quantifying instruction criticality for shared memory multiprocessors
Recent research on processor microarchitecture suggests using instruction criticality as a metric to guide hardware control policies. Fields et al. [3, 4] have proposed a directed...
Tong Li, Alvin R. Lebeck, Daniel J. Sorin
ICDM
2002
IEEE
173views Data Mining» more  ICDM 2002»
15 years 2 months ago
Mining Genes in DNA Using GeneScout
In this paper, we present a new system, called GeneScout, for predicting gene structures in vertebrate genomic DNA. The system contains specially designed hidden Markov models (HM...
Michael M. Yin, Jason Tsong-Li Wang