1188 search results - page 92 / 238 » Extended Graph Unification |
133
click to vote
SCP
2002
15 years 14 days ago
2002
The agent paradigm can be seen as an extension of the notion of (active) objects by concepts like autonomy and cooperation. Mainstream object-oriented modeling techniques do not a...
173
Voted
CIS
2010
Springer
14 years 7 months ago
2010
Springer
A group of mobile robots can localize cooperatively, using relative position and absolute orientation measurements, fused through an extended Kalman filter (ekf). The topology of ...
238
Voted
SDM
2011
SIAM
14 years 3 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
110
Voted
ICPP
2008
IEEE
15 years 7 months ago
2008
IEEE
Solving large, irregular graph problems efficiently is challenging. Current software systems and commodity multiprocessors do not support fine-grained, irregular parallelism wel...
94
Voted
CC
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. To reason about programs, dynamic optimizers and analysis tools use sampling to collect a dynamic call graph (DCG). However, sampling has not achieved high accuracy with ...