Sciweavers

6437 search results - page 302 / 1288
» Parallel Algorithms for Arrangements
Sort
View
IWPEC
2004
Springer
15 years 9 months ago
Computing Small Search Numbers in Linear Time
Let G = V; E be a graph. The linear-width of G is de ned as the smallest integer k such that E can be arranged in a linear ordering e1; : : : ; er such that for every i = 1; :...
Hans L. Bodlaender, Dimitrios M. Thilikos
107
Voted
IMC
2003
ACM
15 years 9 months ago
Simple network performance tomography
In network performance tomography, characteristics of the network interior are inferred by correlating end-to-end measurements. In much previous work, the presence of correlations...
Nick G. Duffield
ICRA
2002
IEEE
146views Robotics» more  ICRA 2002»
15 years 8 months ago
Real-Time Combinatorial Tracking of a Target Moving Unpredictably among Obstacles
Abstract—Many applications require continuous monitoring of a moving target by a controllable vision system. Although the goal of tracking objects is not new, traditional techniq...
Héctor H. González-Baños, Che...
ICDE
2010
IEEE
184views Database» more  ICDE 2010»
15 years 8 months ago
On optimal anonymization for l+-diversity
-- Publishing person specific data while protecting privacy is an important problem. Existing algorithms that enforce the privacy principle called l-diversity are heuristic based d...
Junqiang Liu, Ke Wang
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
15 years 7 months ago
A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
We consider the problem of pricing items so as to maximize the profit made from selling these items. An instance is given by a set E of n items and a set of m clients, where each c...
Khaled M. Elbassioni, René Sitters, Yan Zha...