Sciweavers

1439 search results - page 45 / 288
» Fast approximation of centrality
Sort
View
ICRA
2003
IEEE
171views Robotics» more  ICRA 2003»
14 years 4 months ago
Motion planning for multiple mobile robots using dynamic networks
- A new motion planning framework is presented that enables multiple mobile robots with limited ranges of sensing and communication to maneuver and achieve goals safely in dynamic ...
Christopher M. Clark, Stephen M. Rock, Jean-Claude...
IRAL
2003
ACM
14 years 4 months ago
Temporal ranking for fresh information retrieval
In business, the retrieval of up-to-date, or fresh, information is very important. It is difficult for conventional search engines based on a centralized architecture to retrieve ...
Nobuyoshi Sato, Minoru Uehara, Yoshifumi Sakai
MASCOTS
2008
14 years 13 days ago
On the Stability of Best Effort Flow Control Mechanisms in On-Chip Architectures
In this paper we present a centralized flow control scheme in NoCs in the presence of both elastic and streaming flow traffic paradigms. We model the desired Best Effort (BE) sour...
Mohammad Sadegh Talebi, Ahmad Khonsari
CVPR
2000
IEEE
15 years 1 months ago
Learning in Gibbsian Fields: How Accurate and How Fast Can It Be?
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
Song Chun Zhu, Xiuwen Liu
EDBT
2011
ACM
281views Database» more  EDBT 2011»
13 years 2 months ago
Fast and accurate computation of equi-depth histograms over data streams
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
Hamid Mousavi, Carlo Zaniolo