Sciweavers

9849 search results - page 266 / 1970
» Algorithms and Experiments for the Webgraph
Sort
View
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
15 years 5 months ago
Efficient two-sided error-tolerant search
We consider fast two-sided error-tolerant search that is robust against errors both on the query side (type alogrithm, find documents with algorithm) as well as on the document si...
Hannah Bast, Marjan Celikik
JMLR
2010
133views more  JMLR 2010»
15 years 2 months ago
Exclusive Lasso for Multi-task Feature Selection
We propose a novel group regularization which we call exclusive lasso. Unlike the group lasso regularizer that assumes covarying variables in groups, the proposed exclusive lasso ...
Yang Zhou, Rong Jin, Steven C. H. Hoi
TIP
2010
163views more  TIP 2010»
15 years 1 months ago
Fast Image Recovery Using Variable Splitting and Constrained Optimization
We propose a new fast algorithm for solving one of the standard formulations of image restoration and reconstruction which consists of an unconstrained optimization problem where t...
Manya V. Afonso, José M. Bioucas-Dias, M&aa...
CORR
2011
Springer
255views Education» more  CORR 2011»
14 years 11 months ago
Link Spam Detection based on DBSpamClust with Fuzzy C-means Clustering
This Search engine became omnipresent means for ingoing to the web. Spamming Search engine is the technique to deceiving the ranking in search engine and it inflates the ranking. ...
S. K. Jayanthi, S. Sasikala
ICASSP
2011
IEEE
14 years 11 months ago
Keypoint-based near-duplicate images detection using affine invariant feature and color matching
This paper presents a new keypoint-based approach to nearduplicate images detection. It consists of three steps. Firstly, the keypoints of images are extracted and then matched. S...
Yue Wang, Zujun Hou, Karianto Leman