Sciweavers

19866 search results - page 359 / 3974
» Computing all factorizations in ***
Sort
View
ICRA
1993
IEEE
118views Robotics» more  ICRA 1993»
15 years 11 months ago
Mechanical Computation for Passive Force Control
Force control implemented by a passive mechanical device (perhaps a wrist) has inherent advantages over active implementations. A passive mechanical device can regain some of the ...
Ambarish Goswami, Michael A. Peshkin
ECIR
2008
Springer
15 years 8 months ago
Computing Information Retrieval Performance Measures Efficiently in the Presence of Tied Scores
Abstract. The Information Retrieval community uses a variety of performance measures to evaluate the effectiveness of scoring functions. In this paper, we show how to adapt six pop...
Frank McSherry, Marc Najork
CSL
2010
Springer
15 years 8 months ago
On the Computability of Region-Based Euclidean Logics
By a Euclidean logic, we understand a formal language whose variables range over subsets of Euclidean space, of some fixed dimension, and whose non-logical primitives have fixed me...
Yavor Nenov, Ian Pratt-Hartmann
CORR
1998
Springer
85views Education» more  CORR 1998»
15 years 6 months ago
The Proper Treatment of Optimality in Computational Phonology
Abstract. This paper presents a novel formalization of optimality theory. Unlike previous treatments of optimality in computational linguistics, starting with Ellison 1994, the n...
Lauri Karttunen
TON
2010
158views more  TON 2010»
15 years 5 months ago
Always acyclic distributed path computation
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
Saikat Ray, Roch Guérin, Kin Wah Kwong, Rut...