Sciweavers

2292 search results - page 456 / 459
» Hierarchical approximation and localization
Sort
View
VRST
2010
ACM
14 years 7 months ago
Region-of-interest volumetric visual hull refinement
This paper introduces a region-of-interest visual hull refinement technique, based on flexible voxel grids for volumetric visual hull reconstructions. Region-of-interest refinemen...
Daniel Knoblauch, Falko Kuester
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
14 years 7 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen
99
Voted
EWC
2010
178views more  EWC 2010»
14 years 6 months ago
Design of tensegrity structures using parametric analysis and stochastic search
Tensegrity structures are lightweight structures composed of cables in tension and struts in compression. Since tensegrity systems exhibit geometrically nonlinear behavior, findin...
Landolf Rhode-Barbarigos, Himanshu Jain, Prakash K...
CORR
2011
Springer
174views Education» more  CORR 2011»
14 years 4 months ago
Distributed Private Data Analysis: On Simultaneously Solving How and What
We examine the combination of two directions in the field of privacy concerning computations over distributed private inputs – secure function evaluation (SFE) and differential...
Amos Beimel, Kobbi Nissim, Eran Omri
KAIS
2011
129views more  KAIS 2011»
14 years 4 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis