Sciweavers

1441 search results - page 205 / 289
» A Practical Approach to Network-Based Processing
Sort
View
ISAAC
2003
Springer
141views Algorithms» more  ISAAC 2003»
15 years 5 months ago
Quasi-optimal Arithmetic for Quaternion Polynomials
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
Martin Ziegler
ESWS
2010
Springer
14 years 11 months ago
The Semantic Gap of Formalized Meaning
Recent work in Ontology learning and Text mining has mainly focused on engineering methods to solve practical problem. In this thesis, we investigate methods that can substantially...
Sebastian Hellmann
PAISI
2010
Springer
14 years 10 months ago
Efficient Privacy Preserving K-Means Clustering
Abstract. This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties. Clustering i...
Maneesh Upmanyu, Anoop M. Namboodiri, Kannan Srina...
SIGMOD
2012
ACM
210views Database» more  SIGMOD 2012»
13 years 2 months ago
Interactive regret minimization
We study the notion of regret ratio proposed in [19] to deal with multi-criteria decision making in database systems. The regret minimization query proposed in [19] was shown to h...
Danupon Nanongkai, Ashwin Lall, Atish Das Sarma, K...
CVPR
2007
IEEE
16 years 2 months ago
Spatial selection for attentional visual tracking
Long-duration tracking of general targets is quite challenging for computer vision, because in practice target may undergo large uncertainties in its visual appearance and the unc...
Ming Yang, Junsong Yuan, Ying Wu