Sciweavers

1350 search results - page 242 / 270
» Reasoning about Staged Computation
Sort
View
PLDI
2009
ACM
15 years 4 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
IROS
2009
IEEE
185views Robotics» more  IROS 2009»
15 years 4 months ago
Scalable and convergent multi-robot passive and active sensing
— A major barrier preventing the wide employment of mobile networks of robots in tasks such as exploration, mapping, surveillance, and environmental monitoring is the lack of ef...
Elias B. Kosmatopoulos, Lefteris Doitsidis, Konsta...
CHI
1999
ACM
15 years 2 months ago
Design Guidelines for Landmarks to Support Navigation in Virtual Environments
not abstract asymmetry: different sides looks different clumps different from ”data objects” need grid structure, alignment [Design Guidelines for Landmarks to Support Navigati...
Norman G. Vinson
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
15 years 1 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
COORDINATION
2008
Springer
14 years 11 months ago
A Process Calculus for Mobile Ad Hoc Networks
We present the -calculus, a process calculus for formally modeling and reasoning about Mobile Ad Hoc Wireless Networks (MANETs) and their protocols. The -calculus naturally capture...
Anu Singh, C. R. Ramakrishnan, Scott A. Smolka