Sciweavers

6320 search results - page 158 / 1264
» Towards Situated Computing
Sort
View
161
Voted
CORR
2002
Springer
123views Education» more  CORR 2002»
15 years 6 months ago
Ideal decompositions and computation of tensor normal forms
Abstract. Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[Sr] of a symmetric group Sr. If for a class of tenso...
Bernd Fiedler
168
Voted
ICRA
2010
IEEE
106views Robotics» more  ICRA 2010»
15 years 4 months ago
Computing push plans for disk-shaped robots
Suppose we want to move a passive object along a given path, among obstacles in the plane, by pushing it with an active robot. We present two algorithms to compute a push plan for...
Mark de Berg, Dirk H. P. Gerrits
IJCNN
2006
IEEE
16 years 5 days ago
A computational intelligence-based criterion to detect non-stationarity trends
—The stationarity hypothesis is largely and implicitly assumed when designing classifiers (especially those for industrial applications) but it does not generally hold in practic...
Cesare Alippi, Manuel Roveri
AAAI
2008
15 years 8 months ago
Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation
Abductive diagnosis is an important method to identify explanations for a given set of observations. Unfortunately, most of the algorithmic problems in this area are intractable. ...
Georg Gottlob, Reinhard Pichler, Fang Wei
IJCAT
2006
88views more  IJCAT 2006»
15 years 6 months ago
Interaction design patterns for computers in sociable use
: This article contributes to a growing body of design patterns in interaction design for cooperative work, while also describing how to go from field studies to design patterns. I...
Mattias Arvola