Sciweavers

226 search results - page 10 / 46
» A Practical Algorithm to Find the Best Subsequence Patterns
Sort
View
KDD
2009
ACM
216views Data Mining» more  KDD 2009»
14 years 8 months ago
Finding a team of experts in social networks
Given a task T , a pool of individuals X with different skills, and a social network G that captures the compatibility among these individuals, we study the problem of finding X ,...
Theodoros Lappas, Kun Liu, Evimaria Terzi
ICC
2007
IEEE
14 years 1 months ago
Practical Limits of Multi-Tone Signaling Over High-Speed Backplane Electrical Links
— Application of Discrete Multi-tone (DMT) signaling to high-speed backplane interconnects requires major modifications to the well-known analysis methods applied to wireline com...
Amir Amirkhany, Ali-Azam Abbasfar, Vladimir Stojan...
COOPIS
2004
IEEE
13 years 11 months ago
Classification and Analysis of Distributed Event Filtering Algorithms
Publish/subscribe middleware provides efficient support for loosely coupled communication in distributed systems. A number of different distributed message-filtering algorithms hav...
Sven Bittner, Annika Hinze
EDBT
2008
ACM
150views Database» more  EDBT 2008»
14 years 7 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
CLEF
2010
Springer
13 years 2 months ago
FastDocode: Finding Approximated Segments of N-Grams for Document Copy Detection - Lab Report for PAN at CLEF 2010
Nowadays, plagiarism has been presented as one of the main distresses that the information technology revolution has lead into our society for which using pattern matching algorith...
Gabriel Oberreuter, Gaston L'Huillier, Sebasti&aac...