Sciweavers

3227 search results - page 309 / 646
» Designing with Distance Fields
Sort
View
CIKM
2006
Springer
15 years 8 months ago
An integer programming approach for frequent itemset hiding
The rapid growth of transactional data brought, soon enough, into attention the need of its further exploitation. In this paper, we investigate the problem of securing sensitive k...
Aris Gkoulalas-Divanis, Vassilios S. Verykios
154
Voted
ECTEL
2009
Springer
15 years 8 months ago
Remote Hands-On Experience: Distributed Collaboration with Augmented Reality
One claim of Technology-Enhanced Learning (TEL) is to support and exploit benefits from distance learning and remote collaboration. On the other hand, several approaches to learnin...
Matthias Krauß, Kai Riege, Marcus Winter, Ly...
SODA
2007
ACM
106views Algorithms» more  SODA 2007»
15 years 6 months ago
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
Ittai Abraham, Yair Bartal, Ofer Neiman
146
Voted
IADIS
2004
15 years 6 months ago
SPERO - A Personalized Integrated E-Learning System
One of the most important topics in modern Internet-based multimedia e-learning systems oriented towards teachers, students and learners in general, is the treatment of informatio...
Paraskevi K. Tzouveli, Phivos Mylonas, Stefanos D....
ECCC
2010
95views more  ECCC 2010»
15 years 5 months ago
Bounded-depth circuits cannot sample good codes
We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound of 1 - 1/n(1) on the st...
Shachar Lovett, Emanuele Viola