Sciweavers

6575 search results - page 1236 / 1315
» Specializing visualization algorithms
Sort
View
SPAA
2003
ACM
14 years 28 days ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
WPES
2003
ACM
14 years 28 days ago
Anonymous credentials with biometrically-enforced non-transferability
We present a model and protocol for anonymous credentials. Rather than using deterrents to ensure non-transferability, our model uses secure hardware with biometric authentication...
Russell Impagliazzo, Sara Miner More
CCS
2003
ACM
14 years 28 days ago
Countering code-injection attacks with instruction-set randomization
We describe a new, general approach for safeguarding systems against any type of code-injection attack. We apply Kerckhoff’s principle, by creating process-specific randomized ...
Gaurav S. Kc, Angelos D. Keromytis, Vassilis Preve...
SIGCSE
2010
ACM
175views Education» more  SIGCSE 2010»
14 years 25 days ago
MPCT: media propelled computational thinking
Media-Propelled Computational Thinking (MPCT – pronounced impact) is a course designed to introduce programming in the context of engaging problems in media computation, math, a...
Eric Andrew Freudenthal, Mary K. Roy, Alexandria N...
JCDL
2010
ACM
199views Education» more  JCDL 2010»
14 years 23 days ago
Crowdsourcing the assembly of concept hierarchies
The“wisdom of crowds”is accomplishing tasks that are cumbersome for individuals yet cannot be fully automated by means of specialized computer algorithms. One such task is the...
Kai Eckert, Mathias Niepert, Christof Niemann, Cam...
« Prev « First page 1236 / 1315 Last » Next »