Sciweavers

1520 search results - page 266 / 304
» The Ring Loading Problem
Sort
View
DASFAA
2007
IEEE
221views Database» more  DASFAA 2007»
14 years 4 months ago
TwigList : Make Twig Pattern Matching Fast
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...
Lu Qin, Jeffrey Xu Yu, Bolin Ding
GLOBECOM
2007
IEEE
14 years 4 months ago
Joint Congestion Control and Burst Contention Resolution in Optical Burst Switching Networks
Abstract— This paper revisits burst contention resolution problems in optical burst switching (OBS) networks from the viewpoint of network utility maximization. Burst collision o...
Won-Seok Park, Minsu Shin, Hyang-Won Lee, Song Cho...
ESA
2007
Springer
115views Algorithms» more  ESA 2007»
14 years 3 months ago
Approximation of Partial Capacitated Vertex Cover
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
Reuven Bar-Yehuda, Guy Flysher, Julián Mest...
SSD
2007
Springer
243views Database» more  SSD 2007»
14 years 3 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
BROADNETS
2006
IEEE
14 years 3 months ago
Distributed Job Scheduling based on Multiple Constraints Anycast Routing
— As the popularity of resource-constrained devices such as hand-held computers increases, a new network service offloading complex processing tasks towards computational resour...
Tim Stevens, Marc De Leenheer, Filip De Turck, Bar...