Sciweavers

1734 search results - page 347 / 347
» What works
Sort
View
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 8 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
VAMOS
2007
Springer
14 years 1 months ago
A Plea for Help with Variability, in Two Acts
A short theatrical exaggeration (but not too much) which describes practical problems with variability as experienced by real-world software developers. Real issue, there are no p...
Reed Little, Randy Blohm
IMC
2010
ACM
13 years 5 months ago
YouTube traffic dynamics and its interplay with a tier-1 ISP: an ISP perspective
In this paper we conduct an extensive and in-depth study of traffic exchanged between YouTube data centers and its users, as seen from the perspective of a tier-1 ISP in Spring 20...
Vijay Kumar Adhikari, Sourabh Jain, Zhi-Li Zhang
CORIA
2011
12 years 11 months ago
Mining the Web for lists of Named Entities
Named entities play an important role in Information Extraction. They represent unitary namable information within text. In this work, we focus on groups of named entities of the s...
Arlind Kopliku, Mohand Boughanem, Karen Pinel-Sauv...