Sciweavers

198 search results - page 26 / 40
» Evidence-invariant Sensitivity Bounds
Sort
View
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
14 years 8 months ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger
CSCW
2010
ACM
14 years 4 months ago
Student athletes on facebook
Student athletes at U.S. universities are bound by rules affecting their participation in their sport and are highly visible to their fellow students and a larger public of fans. ...
Cliff Lampe, Nicole Ellison
EDBT
2010
ACM
110views Database» more  EDBT 2010»
14 years 2 months ago
The hardness and approximation algorithms for l-diversity
The existing solutions to privacy preserving publication can be classified into the theoretical and heuristic categories. The former guarantees provably low information loss, whe...
Xiaokui Xiao, Ke Yi, Yufei Tao
CDC
2008
IEEE
140views Control Systems» more  CDC 2008»
14 years 2 months ago
Optimal control of a voice-coil-motor with Coulombic friction
— The voice-coil-motor is a widely used mechatronic device, which represents a typical electrodynamic actuator for machine tool axes, bonding machines and hydraulic/pneumatic val...
Bahne Christiansen, Helmut Maurer, Oliver Zirn
CDC
2008
IEEE
129views Control Systems» more  CDC 2008»
14 years 2 months ago
On the structure of graph edge designs that optimize the algebraic connectivity
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...
Yan Wan, Sandip Roy, Xu Wang, Ali Saberi, Tao Yang...