Sciweavers

446 search results - page 62 / 90
» A Study of Dead Data Members in C Applications
Sort
View
SOUPS
2005
ACM
14 years 2 months ago
Attacking information visualization system usability overloading and deceiving the human
Information visualization is an effective way to easily comprehend large amounts of data. For such systems to be truly effective, the information visualization designer must be aw...
Gregory J. Conti, Mustaque Ahamad, John T. Stasko
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 9 months ago
Mosaic: Policy Homomorphic Network Extension
With the advent of large-scale cloud computing infrastructures, network extension has emerged as a major challenge in the management of modern enterprise networks. Many enterprise...
L. Erran Li, Michael F. Nowlan, Y. R. Yang
ECCC
2010
95views more  ECCC 2010»
13 years 9 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
TOCS
2008
107views more  TOCS 2008»
13 years 8 months ago
RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks
RaWMS is a novel lightweight random membership service for ad hoc networks. The service provides each node with a partial uniformly chosen view of network nodes. Such a membership...
Ziv Bar-Yossef, Roy Friedman, Gabriel Kliot
ICMCS
2007
IEEE
162views Multimedia» more  ICMCS 2007»
14 years 22 days ago
User-Assisted People Search in Consumer Image Collections
In this paper, we investigate the process of searching for images of specified people in the consumer family photo domain. This domain is very different from the controlled enviro...
Andrew C. Gallagher, Madirakshi Das, Alexander C. ...