Sciweavers

1324 search results - page 224 / 265
» Process Coordination with Fetch-and-Increment
Sort
View
3DIM
2007
IEEE
16 years 10 days ago
Cached k-d tree search for ICP algorithms
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...
ATAL
2007
Springer
16 years 5 days ago
A globally optimal algorithm for TTD-MDPs
In this paper, we discuss the use of Targeted Trajectory Distribution Markov Decision Processes (TTD-MDPs)—a variant of MDPs in which the goal is to realize a specified distrib...
Sooraj Bhat, David L. Roberts, Mark J. Nelson, Cha...
SCESM
2006
ACM
238views Algorithms» more  SCESM 2006»
15 years 12 months ago
Nobody's perfect: interactive synthesis from parametrized real-time scenarios
As technical systems keep growing more complex and sophisticated, designing software for the safety-critical coordination between their components becomes increasingly difficult....
Holger Giese, Stefan Henkler, Martin Hirsch, Flori...
SOUPS
2005
ACM
15 years 11 months ago
Developing privacy guidelines for social location disclosure applications and services
In this article, we describe the design process of Reno, a location-enhanced, mobile coordination tool and person finder. The design process included three field experiments: a ...
Giovanni Iachello, Ian E. Smith, Sunny Consolvo, M...
TAL
2004
Springer
15 years 11 months ago
One Size Fits All? A Simple Technique to Perform Several NLP Tasks
Word fragments or n-grams have been widely used to perform different Natural Language Processing tasks such as information retrieval [1] [2], document categorization [3], automatic...
Daniel Gayo-Avello, Darío Álvarez Gu...