Ε-net

Results: 45



#Item
11Small Strong Epsilon NetsI Pradeesha Ashok, Umair Azmi, Sathish Govindarajan Dept. of Computer Science and Automation, Indian Institute of Science, Bangalore, India  Abstract

Small Strong Epsilon NetsI Pradeesha Ashok, Umair Azmi, Sathish Govindarajan Dept. of Computer Science and Automation, Indian Institute of Science, Bangalore, India Abstract

Add to Reading List

Source URL: drona.csa.iisc.ernet.in

Language: English - Date: 2012-09-27 09:02:19
12Mergeable Summaries Pankaj K. Agarwal Graham Cormode Zhewei Wei

Mergeable Summaries Pankaj K. Agarwal Graham Cormode Zhewei Wei

Add to Reading List

Source URL: www.cs.utah.edu

Language: English - Date: 2011-08-26 19:16:55
13CCCG 2010, Winnipeg MB, August 9–11, 2010  Small Strong Epsilon Nets Pradeesha Ashok∗  Sathish Govindarajan†

CCCG 2010, Winnipeg MB, August 9–11, 2010 Small Strong Epsilon Nets Pradeesha Ashok∗ Sathish Govindarajan†

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2010-07-19 10:46:17
14CCCG 2013, Waterloo, Ontario, August 8–10, 2013  Privacy by Fake Data: A Geometric Approach Victor Alvarez∗  Erin Chambers†

CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Privacy by Fake Data: A Geometric Approach Victor Alvarez∗ Erin Chambers†

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2013-08-11 21:51:56
15CCCG 2006, Kingston, Ontario, August 14–16, 2006  Small Weak Epsilon-Nets in Three Dimensions Maryam Babazadeh∗  Abstract

CCCG 2006, Kingston, Ontario, August 14–16, 2006 Small Weak Epsilon-Nets in Three Dimensions Maryam Babazadeh∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-27 22:57:27
16Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points ∗ Pankaj K. Agarwal† 1

Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points ∗ Pankaj K. Agarwal† 1

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2005-07-31 13:55:46
17CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008  Core-Preserving Algorithms Hamid Zarrabi-Zadeh∗  Abstract

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Core-Preserving Algorithms Hamid Zarrabi-Zadeh∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:09:14
18CCCG 2010, Winnipeg MB, August 9–11, 2010  Approximating Range-Aggregate Queries using Coresets Yakov Nekrich∗  Abstract

CCCG 2010, Winnipeg MB, August 9–11, 2010 Approximating Range-Aggregate Queries using Coresets Yakov Nekrich∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2010-07-19 10:46:19
19CCCG 2007, Ottawa, Ontario, August 20–22, 2007  Exact and approximate Geometric Pattern Matching for point sets in the plane under similarity transformations ∗ Dror Aiger†

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Exact and approximate Geometric Pattern Matching for point sets in the plane under similarity transformations ∗ Dror Aiger†

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:28:44
20Approximating TSP on Metrics with Bounded Global Growth∗ T-H. Hubert Chan Abstract The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on (high-dimensional) Euc

Approximating TSP on Metrics with Bounded Global Growth∗ T-H. Hubert Chan Abstract The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on (high-dimensional) Euc

Add to Reading List

Source URL: i.cs.hku.hk

Language: English - Date: 2007-10-10 14:10:39