Sciweavers

14165 search results - page 438 / 2833
» The generalized two-server problem
Sort
View
COMPGEOM
2011
ACM
14 years 10 months ago
Metric graph reconstruction from noisy data
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...
Mridul Aanjaneya, Frédéric Chazal, D...
ICALP
2011
Springer
14 years 10 months ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner
ICASSP
2011
IEEE
14 years 10 months ago
Weighted and structured sparse total least-squares for perturbed compressive sampling
Solving linear regression problems based on the total least-squares (TLS) criterion has well-documented merits in various applications, where perturbations appear both in the data...
Hao Zhu, Georgios B. Giannakis, Geert Leus
SIGMOD
2011
ACM
247views Database» more  SIGMOD 2011»
14 years 9 months ago
Collective spatial keyword querying
With the proliferation of geo-positioning and geo-tagging, spatial web objects that possess both a geographical location and a textual description are gaining in prevalence, and s...
Xin Cao, Gao Cong, Christian S. Jensen, Beng Chin ...
CANS
2011
Springer
292views Cryptology» more  CANS 2011»
14 years 6 months ago
Breaking Fully-Homomorphic-Encryption Challenges
At EUROCRYPT ’10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common div...
Phong Q. Nguyen