Sciweavers

494 search results - page 75 / 99
» Heap Building Bounds
Sort
View
PSYCHNOLOGY
2007
89views more  PSYCHNOLOGY 2007»
14 years 10 months ago
Simple, Fast, Cheap: Success Factors for Interactive Multimedia Tools
This paper discusses key factors contributing to the “success” of interactive multimedia development tools in non ICT professional contexts. We define “success” in terms o...
Davide Bolchini, Nicoletta Di Blas, Franca Garzott...
ISVC
2010
Springer
14 years 9 months ago
Using R-Trees for Interactive Visualization of Large Multidimensional Datasets
Large, multidimensional datasets are difficult to visualize and analyze. Visualization interfaces are constrained in resolution and dimension, so cluttering and problems of project...
Alfredo Giménez, René Rosenbaum, Mar...
SIGMOD
2010
ACM
159views Database» more  SIGMOD 2010»
14 years 9 months ago
Histograms reloaded: the merits of bucket diversity
Virtually all histograms store for each bucket the number of distinct values it contains and their average frequency. In this paper, we question this paradigm. We start out by inv...
Carl-Christian Kanne, Guido Moerkotte
ICIP
2009
IEEE
14 years 8 months ago
Total variation projection with first order schemes
This article proposes a new algorithm to compute the projection on the set of images whose total variation is bounded by a constant. The projection is computed through a dual form...
Mohamed-Jalal Fadili, Gabriel Peyré
ASIACRYPT
2010
Springer
14 years 8 months ago
The Round Complexity of Verifiable Secret Sharing: The Statistical Case
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan