×

Found 69 Documents (Results 1–69)

Categorical range reporting with frequencies. (English) Zbl 07561469

Barcelo, Pablo (ed.) et al., 22nd international conference on database theory, ICDT 2019, March 26–28, 2019, Lisbon, Portugal. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 127, Article 9, 19 p. (2019).
MSC:  68P15
PDFBibTeX XMLCite
Full Text: DOI

Searching for the closest-pair in a query translate. (English) Zbl 07559261

Barequet, Gill (ed.) et al., 35th international symposium on computational geometry, SoCG 2019, Portland, Oregon, USA, June 18–21, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 129, Article 61, 15 p. (2019).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

String attractors: verification and optimization. (English) Zbl 1524.68126

Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 52, 13 p. (2018).
MSC:  68P30 68P05 68W32
PDFBibTeX XMLCite
Full Text: DOI arXiv

New bounds for range closest-pair problems. (English) Zbl 1464.68421

Speckmann, Bettina (ed.) et al., 34th international symposium on computational geometry, SoCG 2018, June 11–14, 2018, Budapest, Hungary. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 99, Article 73, 14 p. (2018).
MSC:  68U05 68P05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Approximate range queries for clustering. (English) Zbl 1489.68369

Speckmann, Bettina (ed.) et al., 34th international symposium on computational geometry, SoCG 2018, June 11–14, 2018, Budapest, Hungary. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 99, Article 62, 14 p. (2018).
MSC:  68U05 68P05 68W25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Finding pairwise intersections of rectangles in a query rectangle. (English) Zbl 1457.68294

Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 60, 12 p. (2017).
MSC:  68U05 68P05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Succinct color searching in one dimension. (English) Zbl 1457.68287

Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 30, 11 p. (2017).
MSC:  68U05 68P05 68P10
PDFBibTeX XMLCite
Full Text: DOI

Querying relational event graphs using colored range searching data structures. (English) Zbl 1453.68128

Gaur, Daya (ed.) et al., Algorithms and discrete applied mathematics. Third international conference, CALDAM 2017, Sancoale, Goa, India, February 16–18, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10156, 83-95 (2017).
MSC:  68R10 68P05 91D30
PDFBibTeX XMLCite
Full Text: DOI

Array range queries. (English) Zbl 1394.68103

Brodnik, Andrej (ed.) et al., Space-efficient data structures, streams, and algorithms. Papers in honor of J. Ian Munro on the occasion of his 66th birthday. Berlin: Springer (ISBN 978-3-642-40272-2/pbk). Lecture Notes in Computer Science 8066, 333-350 (2013).
MSC:  68P05 68P20
PDFBibTeX XMLCite
Full Text: DOI

Range-aggregate queries involving geometric aggregation operations. (English) Zbl 1317.68253

Katoh, Naoki (ed.) et al., WALCOM: Algorithms and computation. 5th international workshop, WALCOM 2011, New Delhi, India, February 18–20, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19093-3/pbk). Lecture Notes in Computer Science 6552, 122-133 (2011).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Efficient top-\(k\) queries for orthogonal ranges. (English) Zbl 1317.68254

Katoh, Naoki (ed.) et al., WALCOM: Algorithms and computation. 5th international workshop, WALCOM 2011, New Delhi, India, February 18–20, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19093-3/pbk). Lecture Notes in Computer Science 6552, 110-121 (2011).
MSC:  68U05 68P05 68W05
PDFBibTeX XMLCite
Full Text: DOI

On the power of the semi-separated pair decomposition. (English) Zbl 1253.68324

Dehne, Frank (ed.) et al., Algorithms and data structures. 11th international symposium, WADS 2009, Banff, Canada, August 21–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03366-7/pbk). Lecture Notes in Computer Science 5664, 1-12 (2009).
MSC:  68U05 68P05 68W05
PDFBibTeX XMLCite
Full Text: DOI Link

On some geometric optimization problems in layered manufacturing. (English) Zbl 1497.68535

Dehne, Frank (ed.) et al., Algorithms and data structures. 5th international workshop, WADS ’97, Halifax, Nova Scotia, Canada, August 6–8, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1272, 136-149 (1997).
MSC:  68U05 68U07 90B30
PDFBibTeX XMLCite
Full Text: DOI Link

Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC-machining. (English) Zbl 1502.68321

Akl, Selim G. (ed.) et al., Algorithms and data structures. 4th international workshop, WADS ’95, Kingston, Canada, August 16–18, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 955, 171-182 (1995).
MSC:  68U05 68U07
PDFBibTeX XMLCite
Full Text: DOI

New upper bounds for generalized intersection searching problems. (English) Zbl 1412.68287

Fülöp, Zoltán (ed.) et al., Automata, languages and programming. 22nd international colloquium, ICALP ’95, Szeged, Hungary, July 10–14, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 944, 464-474 (1995).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software