Sciweavers

1096 search results - page 99 / 220
» Computation Slicing: Techniques and Theory
Sort
View
319
Voted
CORR
2012
Springer
286views Education» more  CORR 2012»
14 years 2 months ago
A Faster Algorithm for Solving One-Clock Priced Timed Games
One-clock priced timed games is a class of two-player, zero-sum, continuous-time games that was defined and thoroughly studied in previous works. We show that One-clock priced ti...
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter ...
309
Voted
ICDE
2008
IEEE
157views Database» more  ICDE 2008»
16 years 8 months ago
OptRR: Optimizing Randomized Response Schemes for Privacy-Preserving Data Mining
The randomized response (RR) technique is a promising technique to disguise private categorical data in Privacy-Preserving Data Mining (PPDM). Although a number of RR-based methods...
Zhengli Huang, Wenliang Du
DAGSTUHL
2010
15 years 8 months ago
Towards Automatic Feature-based Visualization
Visualizations are well suited to communicate large amounts of complex data. With increasing resolution in the spatial and temporal domain simple imaging techniques meet their lim...
Heike Jänicke, Gerik Scheuermann
COMPGEOM
2010
ACM
16 years 1 days ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
182
Voted
CVPR
2003
IEEE
16 years 9 months ago
Mean-shift Blob Tracking through Scale Space
The mean-shift algorithm is an efficient technique for tracking 2D blobs through an image. Although the scale of the mean-shift kernel is a crucial parameter, there is presently n...
Robert T. Collins