Sciweavers

930 search results - page 133 / 186
» Model compression
Sort
View
102
Voted
ICMCS
2000
IEEE
86views Multimedia» more  ICMCS 2000»
15 years 7 months ago
Water-Filling for Watermarking?
In this paper we address the question: Is water-filling appropriate for watermarking? The water-filling paradigm is a traditional solution to the capacity maximization of parall...
Deepa Kundur
CGI
2004
IEEE
15 years 6 months ago
Curvature Tensor Based Triangle Mesh Segmentation with Boundary Rectification
This paper presents a new and efficient algorithm for decomposition of 3D arbitrary triangle mesh into surface patches. Our method is based on the curvature tensor field analysis ...
Guillaume Lavoué, Florent Dupont, Atilla Ba...
133
Voted
AAAI
2008
15 years 5 months ago
Efficient Querying Relaxed Dominant Relationship between Product Items Based on Rank Aggregation
Current search engines cannot effectively rank those relational data, which exists on dynamic websites supported by online databases. In this study, to rank such structured data, ...
Zhenglu Yang, Lin Li, Masaru Kitsuregawa
143
Voted
IPCV
2008
15 years 4 months ago
Robust Hough-Based Symbol Recognition Using Knowledge-Based Hierarchical Neural Networks
Abstract - A robust method for symbol recognition is presented that utilizes a compact signature based on a modified Hough Transform (HT) and knowledge-based hierarchical neural ne...
Alexander Wong, William Bishop
107
Voted
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 2 months ago
Where is Randomness Needed to Break the Square-Root Bottleneck?
As shown by Tropp, 2008, for the concatenation of two orthonormal bases (ONBs), breaking the square-root bottleneck in compressed sensing does not require randomization over all th...
Patrick Kuppinger, Giuseppe Durisi, Helmut Bö...