Sciweavers

552 search results - page 64 / 111
» Lower bounds for dynamic connectivity
Sort
View
CORR
2010
Springer
182views Education» more  CORR 2010»
13 years 9 months ago
Index coding via linear programming
Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...
Anna Blasiak, Robert D. Kleinberg, Eyal Lubetzky
PODS
1995
ACM
124views Database» more  PODS 1995»
14 years 1 months ago
Window Query-Optimal Clustering of Spatial Objects
During the last decade various spatial data structures have been designed and compared against each other with respect to their performance. Still missing is a lower bound result,...
Bernd-Uwe Pagel, Hans-Werner Six, Mario Winter
FUN
2010
Springer
238views Algorithms» more  FUN 2010»
14 years 2 months ago
Mapping an Unfriendly Subway System
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...
Paola Flocchini, Matthew Kellett, Peter C. Mason, ...
ICDE
2010
IEEE
184views Database» more  ICDE 2010»
14 years 1 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
CORR
2007
Springer
47views Education» more  CORR 2007»
13 years 9 months ago
Data Structures for Mergeable Trees
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...
Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robe...