Sciweavers

198 search results - page 29 / 40
» Evidence-invariant Sensitivity Bounds
Sort
View
SIGGRAPH
2000
ACM
15 years 2 months ago
Out-of-core simplification of large polygonal models
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
Peter Lindstrom
AAAI
2007
15 years 1 months ago
Best-First AND/OR Search for Graphical Models
The paper presents and evaluates the power of best-first search over AND/OR search spaces in graphical models. The main virtue of the AND/OR representation is its sensitivity to ...
Radu Marinescu 0002, Rina Dechter
CIARP
2006
Springer
15 years 25 days ago
Robustness Analysis of the Neural Gas Learning Algorithm
The Neural Gas (NG) is a Vector Quantization technique where a set of prototypes self organize to represent the topology structure of the data. The learning algorithm of the Neural...
Carolina Saavedra, Sebastián Moreno, Rodrig...
CMS
2010
138views Communications» more  CMS 2010»
15 years 9 days ago
Tor HTTP Usage and Information Leakage
This paper analyzes the web browsing behaviour of Tor users. By collecting HTTP requests we show which websites are of interest to Tor users and we determined an upper bound on how...
Marcus Huber, Martin Mulazzani, Edgar Weippl
DICTA
2008
15 years 9 days ago
Object Detection Using Multi-local Feature Manifolds
Many object categories are better characterized by the shape of their contour than by local appearance properties like texture or color. Multi-local features are designed in order...
Oscar M. Danielsson, Stefan Carlsson, Josephine Su...