Sciweavers

475 search results - page 59 / 95
» Z3-Connectivity with Independent Number 2
Sort
View
FOCS
2009
IEEE
16 years 21 days ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
IPPS
2009
IEEE
16 years 18 days ago
Portable builds of HPC applications on diverse target platforms
—High-end machines at modern HPC centers are constantly undergoing hardware and system software upgrades – necessitating frequent rebuilds of application codes. The number of p...
Magdalena Slawiñska, Jaroslaw Slawinski, Va...
ICMI
2009
Springer
171views Biometrics» more  ICMI 2009»
16 years 15 days ago
Static vs. dynamic modeling of human nonverbal behavior from multiple cues and modalities
Human nonverbal behavior recognition from multiple cues and modalities has attracted a lot of interest in recent years. Despite the interest, many research questions, including th...
Stavros Petridis, Hatice Gunes, Sebastian Kaltwang...
COCOON
2007
Springer
16 years 3 days ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
ISAAC
2007
Springer
102views Algorithms» more  ISAAC 2007»
16 years 2 days ago
Depth of Field and Cautious-Greedy Routing in Social Networks
Social networks support efficient decentralized search: people can collectively construct short paths to a specified target in the network. Rank-based friendship—where the prob...
David Barbella, George Kachergis, David Liben-Nowe...