Sciweavers

2283 search results - page 324 / 457
» Bounds of Graph Characteristics
Sort
View
136
Voted
CIKM
2010
Springer
15 years 2 months ago
Challenges in personalized authority flow based ranking of social media
As the social interaction of Internet users increases, so does the need to effectively rank social media. We study the challenges of personalized ranking of blog posts. Web search...
Hassan Sayyadi, John Edmonds, Vagelis Hristidis, L...
131
Voted
SSIRI
2010
15 years 1 months ago
A Formal Framework for Mutation Testing
— Model-based approaches, especially based on directed graphs (DG), are becoming popular for mutation testing as they enable definition of simple, nevertheless powerful, mutation...
Fevzi Belli, Mutlu Beyazit
185
Voted
DATAMINE
2010
161views more  DATAMINE 2010»
15 years 25 days ago
Predicting labels for dyadic data
: In dyadic prediction, the input consists of a pair of items (a dyad), and the goal is to predict the value of an observation related to the dyad. Special cases of dyadic predicti...
Aditya Krishna Menon, Charles Elkan
169
Voted
INFOCOM
2011
IEEE
14 years 7 months ago
Network-aware behavior clustering of Internet end hosts
Abstract—This paper explores the behavior similarity of Internet end hosts in the same network prefixes. We use bipartite graphs to model network traffic, and then construct on...
Kuai Xu, Feng Wang 0002, Lin Gu
144
Voted
LATIN
2010
Springer
15 years 10 months ago
Sharp Separation and Applications to Exact and Parameterized Algorithms
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grando...