Sciweavers

182 search results - page 3 / 37
» Some problems with the notion of context-aware computing
Sort
View
LATIN
2010
Springer
14 years 2 months ago
Some Observations on Holographic Algorithms
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
Leslie G. Valiant
IJCNN
2006
IEEE
14 years 1 months ago
Modular Multilayer Perceptron for WLAN Based Localization
Location Awareness is key capability of Context-Aware Ubiquitous environments. Received Signal Strength (RSS) based localization is increasingly popular choice especially for in-bu...
Uzair Ahmad, Andrey Gavrilov, Sungyoung Lee, Young...
FSTTCS
2006
Springer
13 years 11 months ago
Some Results on Average-Case Hardness Within the Polynomial Hierarchy
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...
Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran
AIED
2005
Springer
14 years 1 months ago
The role of learning goals in the design of ILEs: Some issues to consider
Part of the motivation behind the evolution of learning environments is the idea of providing students with individualized instructional strategies that allow them to learn as much...
Erika Martínez-Mirón, Amanda Harris,...
TCS
2008
13 years 7 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman