Sciweavers

5624 search results - page 305 / 1125
» On Conditional Covering Problem
Sort
View
SIGCSE
2002
ACM
211views Education» more  SIGCSE 2002»
15 years 6 months ago
To java.net and beyond: teaching networking concepts using the Java networking API
This paper covers the use of Java and its API for developing networking programs in an undergraduate computer networks class. Through the use of TCP and UDP sockets provided in th...
Greg Gagne
VMCAI
2012
Springer
14 years 2 months ago
Ideal Abstractions for Well-Structured Transition Systems
stractions for Well-Structured Transition Systems Damien Zufferey1 , Thomas Wies2 , and Thomas A. Henzinger1 1 IST Austria 2 New York University Many infinite state systems can be...
Damien Zufferey, Thomas Wies, Thomas A. Henzinger
PODS
2003
ACM
116views Database» more  PODS 2003»
16 years 6 months ago
On nearest neighbor indexing of nonlinear trajectories
In recent years, the problem of indexing mobile objects has assumed great importance because of its relevance to a wide variety of applications. Most previous results in this area...
Charu C. Aggarwal, Dakshi Agrawal
ASIACRYPT
2009
Springer
16 years 1 months ago
Linearization Framework for Collision Attacks: Application to CubeHash and MD6
In this paper, an improved differential cryptanalysis framework for finding collisions in hash functions is provided. Its principle is based on linearization of compression functi...
Eric Brier, Shahram Khazaei, Willi Meier, Thomas P...
LICS
1997
IEEE
15 years 10 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...