Sciweavers

2796 search results - page 377 / 560
» The coolest path problem
Sort
View
WWW
2001
ACM
16 years 7 months ago
A metro map metaphor for guided tours on the Web: the Webvise guided tour system
This paper presents a guided tour system for the WWW. It is a module for the Webvise open hypermedia system that implements the ideas of trails and guided tours, originating from ...
Elmer Sandvad, Kaj Grønbæk, Lennert S...
ICFP
2009
ACM
16 years 7 months ago
A functional I/O system or, fun for freshman kids
Functional programming languages ought to play a central role in mathematics education for middle schools (age range: 10?14). After all, functional programming is a form of algebr...
Matthias Felleisen, Robert Bruce Findler, Matthew ...
CCS
2009
ACM
16 years 7 months ago
Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary
In this paper, we re-visit the problem of unconditionally secure message transmission (USMT) from a sender S to a receiver R, who are part of a distributed synchronous network, mo...
Kannan Srinathan, Arpita Patra, Ashish Choudhary, ...
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 6 months ago
Turning CARTwheels: an alternating algorithm for mining redescriptions
We present an unusual algorithm involving classification trees-CARTwheels--where two trees are grown in opposite directions so that they are joined at their leaves. This approach ...
Naren Ramakrishnan, Deept Kumar, Bud Mishra, Malco...
CADE
2002
Springer
16 years 6 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...