Sciweavers

47 search results - page 8 / 10
» And Or Trees Revisited
Sort
View
TMA
2010
Springer
137views Management» more  TMA 2010»
13 years 3 months ago
K-Dimensional Trees for Continuous Traffic Classification
Abstract. The network measurement community has proposed multiple machine learning (ML) methods for traffic classification during the last years. Although several research works ha...
Valentín Carela-Español, Pere Barlet...
COCOON
2009
Springer
14 years 10 days ago
Convex Recoloring Revisited: Complexity and Exact Algorithms
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
Iyad A. Kanj, Dieter Kratsch
COMPGEOM
2010
ACM
13 years 10 months ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
ICMCS
2010
IEEE
236views Multimedia» more  ICMCS 2010»
13 years 6 months ago
Practical algorithm for minimum delay peer-to-peer media streaming
Though the existence of a minimum delay peer-to-peer media streaming scheme has been shown (under the name of snowball streaming), no actual algorithm has ever been designed so fa...
Jun Luo
ISAAC
2007
Springer
100views Algorithms» more  ISAAC 2007»
13 years 12 months ago
Dynamic Distance Hereditary Graphs Using Split Decomposition
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
Emeric Gioan, Christophe Paul