Sciweavers

5153 search results - page 458 / 1031
» Introduction to Randomized Algorithms
Sort
View
WWW
2009
ACM
16 years 7 months ago
Graffiti: node labeling in heterogeneous networks
We introduce a multi-label classification model and algorithm for labeling heterogeneous networks, where nodes belong to different types and different types have different sets of...
Ralitsa Angelova, Gjergji Kasneci, Fabian M. Sucha...
WWW
2006
ACM
16 years 7 months ago
Detecting nepotistic links by language model disagreement
In this short note we demonstrate the applicability of hyperlink downweighting by means of language model disagreement. The method filters out hyperlinks with no relevance to the ...
András A. Benczúr, István B&i...
DCC
2010
IEEE
16 years 1 months ago
Block Compressed Sensing of Images Using Directional Transforms
Block-based random image sampling is coupled with a projectiondriven compressed-sensing recovery that encourages sparsity in the domain of directional transforms simultaneously wi...
Sungkwang Mun, James E. Fowler
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
16 years 27 days ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl
ICASSP
2008
IEEE
16 years 23 days ago
Performance and robustness: A trade-off in dynamic signature verification
A performance and robustness study for on-line signature veri cation is presented. Experiments are carried out on the MCYT database comprising 16,500 signatures from 330 subjects,...
Javier Galbally, Julian Fiérrez, Javier Ort...