Sciweavers

93 search results - page 19 / 19
» Identifiability: A Fundamental Problem of Student Modeling
Sort
View
SPAA
2004
ACM
14 years 4 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
TMC
2010
158views more  TMC 2010»
13 years 9 months ago
Secure Distance-Based Localization in the Presence of Cheating Beacon Nodes
—Secure distance-based localization in the presence of cheating beacon (or anchor) nodes is an important problem in mobile wireless ad hoc and sensor networks. Despite significa...
Murtuza Jadliwala, Sheng Zhong, Shambhu J. Upadhya...
HOTNETS
2010
13 years 5 months ago
Diagnosing mobile applications in the wild
There are a lot of applications that run on modern mobile operating systems. Inevitably, some of these applications fail in the hands of users. Diagnosing a failure to identify the...
Sharad Agarwal, Ratul Mahajan, Alice Zheng, Victor...