Sciweavers

6455 search results - page 1170 / 1291
» Research problems
Sort
View
STOC
2009
ACM
171views Algorithms» more  STOC 2009»
14 years 11 months ago
On the geometry of graphs with a forbidden minor
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
James R. Lee, Anastasios Sidiropoulos
CADE
2009
Springer
14 years 11 months ago
Integrated Reasoning and Proof Choice Point Selection in the Jahob System - Mechanisms for Program Survival
In recent years researchers have developed a wide range of powerful automated reasoning systems. We have leveraged these systems to build Jahob, a program specification, analysis, ...
Martin C. Rinard
CHI
2009
ACM
14 years 11 months ago
The accidental tutor: overlaying an intelligent tutor on an existing user interface
Intelligent Tutoring Systems (ITSs) have been shown to have dramatic impact on student learning [9]. However, these gains have been mostly in topics in which the interface has bee...
Liz Blankenship, Stephen B. Gilbert, Stephen Bless...
CHI
2009
ACM
14 years 11 months ago
Web search and browsing behavior under poor connectivity
Web search and browsing have been streamlined for a comfortable experience when the network connection is fast. Existing tools, however, are not optimized for scenarios where conn...
Jay Chen, Lakshminarayanan Subramanian, Kentaro To...
SPAA
2009
ACM
14 years 11 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
« Prev « First page 1170 / 1291 Last » Next »