Sciweavers

1421 search results - page 237 / 285
» Algorithms for subsequence combinatorics
Sort
View
ICASSP
2011
IEEE
14 years 6 months ago
A dynamic approach to the selection of high order n-grams in phonotactic language recognition
Due to computational bounds, most SVM-based phonotactic language recognition systems consider only low-order n-grams (up to n = 3), thus limiting the potential performance of this...
Mikel Peñagarikano, Amparo Varona, Luis Jav...
ICASSP
2011
IEEE
14 years 6 months ago
Uncovering elements of style
This paper relates the style of 16th century Flemish paintings by Goossen van der Weyden (GvdW) to the style of preliminary sketches or underpaintings made prior to executing the ...
Josephine Wolff, Maximiliaan Martens, Sina Jafarpo...
ICASSP
2011
IEEE
14 years 6 months ago
An adaptive bayesian clustering and multivariate region merging based technique for efficient segmentation of color images
We propose a methodology for improved segmentation of images in a Bayesian framework by fusion of color, texture and gradient information. The proposed algorithm is initialized by...
Sreenath Rao Vantaram, Eli Saber
SIGIR
2012
ACM
13 years 5 months ago
Building reputation and trust using federated search and opinion mining
The term online reputation addresses trust relationships amongst agents in dynamic open systems. These can appear as ratings, recommendations, referrals and feedback. Several repu...
Somayeh Khatiban
FOCS
2002
IEEE
15 years 8 months ago
Low-Dimensional Linear Programming with Violations
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
Timothy M. Chan