Sciweavers

2414 search results - page 167 / 483
» Computing Normal Subgroups
Sort
View
ICALP
2007
Springer
14 years 3 months ago
Reconciling Data Compression and Kolmogorov Complexity
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
Laurent Bienvenu, Wolfgang Merkle
SIGCSE
2005
ACM
124views Education» more  SIGCSE 2005»
14 years 2 months ago
The virtual network system
The goal of our work is to give students a hands-on experience designing, deploying and debugging parts of the Internet infrastructure, such as an Internet router that routes real...
Martin Casado, Nick McKeown
ICMI
2004
Springer
168views Biometrics» more  ICMI 2004»
14 years 2 months ago
TouchLight: an imaging touch screen and display for gesture-based interaction
A novel touch screen technology is presented. TouchLight uses simple image processing techniques to combine the output of two video cameras placed behind a semi-transparent plane ...
Andrew D. Wilson
ICDCS
2003
IEEE
14 years 2 months ago
Cross-Feature Analysis for Detecting Ad-Hoc Routing Anomalies
With the proliferation of wireless devices, mobile ad hoc networking (MANET) has become a very exciting and important technology due to its characteristics of open medium and dyna...
Yi-an Huang, Wei Fan, Wenke Lee, Philip S. Yu
AAAI
2007
13 years 11 months ago
A New Algorithm for Generating Equilibria in Massive Zero-Sum Games
In normal scenarios, computer scientists often consider the number of states in a game to capture the difficulty of learning an equilibrium. However, players do not see games in ...
Martin Zinkevich, Michael H. Bowling, Neil Burch