Sciweavers

500 search results - page 76 / 100
» Improving Search in Peer-to-Peer Networks
Sort
View
JMLR
2008
209views more  JMLR 2008»
13 years 8 months ago
Bayesian Inference and Optimal Design for the Sparse Linear Model
The linear model with sparsity-favouring prior on the coefficients has important applications in many different domains. In machine learning, most methods to date search for maxim...
Matthias W. Seeger
ANCS
2009
ACM
13 years 6 months ago
Range Tries for scalable address lookup
In this paper we introduce the Range Trie, a new multiway tree data structure for address lookup. Each Range Trie node maps to an address range [Na, Nb) and performs multiple comp...
Ioannis Sourdis, Georgios Stefanakis, Ruben de Sme...
ISNN
2011
Springer
12 years 11 months ago
Orthogonal Feature Learning for Time Series Clustering
This paper presents a new method that uses orthogonalized features for time series clustering and classification. To cluster or classify time series data, either original data or...
Xiaozhe Wang, Leo Lopes
WSDM
2012
ACM
334views Data Mining» more  WSDM 2012»
12 years 4 months ago
mTrust: discerning multi-faceted trust in a connected world
Traditionally, research about trust assumes a single type of trust between users. However, trust, as a social concept, inherently has many facets indicating multiple and heterogen...
Jiliang Tang, Huiji Gao, Huan Liu
ICCAD
2004
IEEE
83views Hardware» more  ICCAD 2004»
14 years 5 months ago
Custom-optimized multiplierless implementations of DSP algorithms
Linear DSP kernels such as transforms and filters are comprised exclusively of additions and multiplications by constants. These multiplications may be realized as networks of ad...
Markus Püschel, Adam C. Zelinski, James C. Ho...