Sciweavers

1712 search results - page 328 / 343
» A Computational Approach to Binding Theory
Sort
View
112
Voted
FOCS
2002
IEEE
15 years 6 months ago
Learning Intersections and Thresholds of Halfspaces
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
Adam Klivans, Ryan O'Donnell, Rocco A. Servedio
HUC
2009
Springer
15 years 6 months ago
From spaces to places: emerging contexts in mobile privacy
Mobile privacy concerns are central to Ubicomp and yet remain poorly understood. We advocate a diversified approach, enabling the cross-interpretation of data from complementary m...
Clara Mancini, Keerthi Thomas, Yvonne Rogers, Blai...
HUC
2009
Springer
15 years 6 months ago
Simultaneous localization and mapping for pedestrians using only foot-mounted inertial sensors
In this paper we describe a new Bayesian estimation approach for simultaneous mapping and localization for pedestrians based on odometry with foot mounted inertial sensors. When s...
Patrick Robertson, Michael Angermann, Bernhard Kra...
CHI
2010
ACM
15 years 5 months ago
Where is my team: supporting situation awareness with tactile displays
A group of friends visiting a crowded and noisy music festival is an example of a situation where knowing the location of other people is important, but where external factors, su...
Martin Pielot, Oliver Krull, Susanne Boll
FOSSACS
1999
Springer
15 years 5 months ago
A Strong Logic Programming View for Static Embedded Implications
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...
R. Arruabarrena, Paqui Lucio, Marisa Navarro