6202 search results - page 902 / 1241 » Without Loss of Generality |
186
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
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...
168
click to vote
CHI
2009
ACM
16 years 7 months ago
2009
ACM
For the majority of blind people, walking in unknown places is a very difficult, or even impossible, task to perform, when without help. The adoption of the white cane is the main...
149
click to vote
SIGCSE
2009
ACM
16 years 7 months ago
2009
ACM
This paper presents a methodology for increasing undergraduate Computer Science (CS) major enrollment at comprehensive public universities, particularly those that have first gene...
216
click to vote
PPOPP
2009
ACM
16 years 7 months ago
2009
ACM
This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our app...
180
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...