Sciweavers

19866 search results - page 67 / 3974
» Computing all factorizations in ***
Sort
View
ACMDIS
2004
ACM
15 years 11 months ago
Privacy risk models for designing privacy-sensitive ubiquitous computing systems
Privacy is a difficult design issue that is becoming increasingly important as we push into ubiquitous computing environments. While there is a fair amount of theoretical work on ...
Jason I. Hong, Jennifer D. Ng, Scott Lederer, Jame...
SIGCSE
2009
ACM
149views Education» more  SIGCSE 2009»
16 years 6 months ago
GINI: a user-level toolkit for creating micro internets for teaching & learning computer networking
GINI (GINI Is Not Internet) is an open-source toolkit for creating virtual micro Internets for teaching and learning computer networking. It provides lightweight virtual elements ...
Muthucumaru Maheswaran, Alexis Malozemoff, Daniel ...
SIGCSE
2008
ACM
104views Education» more  SIGCSE 2008»
15 years 6 months ago
Inspiring blind high school students to pursue computer science with instant messaging chatbots
Blind students are an underrepresented group in computer science. In this paper, we describe our experience preparing and leading the computer science track at the National Federa...
Jeffrey P. Bigham, Maxwell B. Aller, Jeremy T. Bru...
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
16 years 6 months ago
Approximate Confidence Computation in Probabilistic Databases
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
Dan Olteanu, Jiewen Huang, Christoph Koch
FOCS
2008
IEEE
16 years 22 days ago
Computing the Tutte Polynomial in Vertex-Exponential Time
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
Andreas Björklund, Thore Husfeldt, Petteri Ka...