Search results

...hm]]s and [[computational geometry]]. He is known for his work on matching geometric shapes, including methods for efficiently computing the [[Fréchet distance] ...horn]] at [[Saarland University]], where he completed his Ph.D. in 1976 on algorithms for parsing [[context-free language]]s.{{r|mg}} ...

...enclosing boxes.|volume=14|year=1985|issue=3|s2cid=8311538}}. As reviewed in {{zbl|0582.68067}}</ref> In 1985, O'Rourke was both the local arrangements chair and the program chair ...

{{Short description|Book published in 1995}}{{Infobox book ...lished by [[Cambridge University Press]] in 1995, with a paperback reprint in 2010. ...

.... He is a researcher at the [[IBM Almaden Research Center]], and co-editor-in-chief of ''[[Discrete and Computational Geometry]]''<ref>[https://link.spri Clarkson received his Ph.D. from [[Stanford University]] in 1984, under the supervision of [[Andrew Yao]].<ref>[http://sigact.acm.org/c ...

...y]].{{r|appointed}} She holds the chair for Algorithms and Data Structures in the Computer Science Department at [[Heinrich Heine University Düsseldorf]] ...([[Dr. rer. nat.]]) in 2014 with the dissertation ''Coresets and streaming algorithms for the {{nowrap|<math>k</math>-means}} problem and related clustering obje ...

...Maryland, College Park]] department of computer science whose research is in [[computational geometry]]. ...]] in 1977 and received his Ph.D. in Computer Science at Purdue University in 1983 under the advisement of Christoph Hoffmann. ...

...each hypothesis give a most probable action. This technique is widely used in the area of [[artificial intelligence]]. ...images. Geometric features are features of objects constructed by a set of geometric elements like points, lines, curves or surfaces. These features can be corn ...

...in terms of time and energy): arithmetic and communication. Communication, in this context refers to moving data, either between levels of memory or betw A common computational model in analyzing communication-avoiding algorithms is the two-level memory model: ...

...sage of diameter also occurs in medical terminology concerning a lesion or in [[geology]] concerning a rock. ...ound]] (denoted "sup") of the set of all distances between pairs of points in the object. ...

...=1990|url=http://dx.doi.org/10.1007/978-3-322-92106-2_6|work=Combinatorial Algorithms for Integrated Circuit Layout|pages=251–301|place=Wiesbaden|publisher=Viewe ...comes from the fact that the dimensions of the small rectangles are fixed in advance. The optimization goals are usually to maximize the area of the pro ...

...2017">{{cite journal |title=Quantum image processing: A review of advances in its security technologies |journal=International Journal of Quantum Informa ...3429P |doi=10.1103/PhysRevA.52.R3429 |pmid=9912767 }}</ref> and formalized in <ref name="Lugiato quantum 2002">{{cite journal |title=Quantum imaging |jou ...

...nested subcomplexes within the Vietoris–Rips filtration on a set of points in the Euclidean plane.]] ...ration is a multiscale extension of the Vietoris–Rips complex that enables researchers to detect and track the persistence of [[Topology|topological]] features, o ...

...criss-cross algorithm visits all&nbsp;8 corners of the [[Klee–Minty cube]] in the worst case. It visits&nbsp;3 additional corners on&nbsp;average. The Kl ...[[optimization (mathematics)|objective functions]]; there are criss-cross algorithms for [[linear-fractional programming]] problems,<ref name="LF99Hyperbolic">{ ...

...r 22, 1942) is an American mathematician, with an international reputation in [[numerical analysis]], [[approximation theory]], and [[machine learning]]. ...dad Zaragoza|url=https://honoris.unizar.es/hc/charles-anthony-micchelli}} (in Spanish)</ref> His PhD thesis ''Saturation Classes and Iterates of Operator ...

...> it has since gained significant attention for its potential applications in computer graphics and content creation.<ref name=":0" /> ...homas |editor4-last=Frahm |editor4-first=Jan-Michael |series=Lecture Notes in Computer Science |volume=12346 |language=en |location=Cham |publisher=Sprin ...

...t estimates the area of a [[minimal surface]] in a [[Riemannian manifold]] in terms of the length of the boundary curve of that surface. ...[[minimal surface]] bounding a [[null-homotopic]] closed curve is bounded in terms of the length of that curve. ...

...he other hand, a bag is labeled positive if there is at least one instance in it which is positive. From a collection of labeled bags, the learner tries ...nko (2008)<ref name = Babenko>Babenko, Boris. "Multiple instance learning: algorithms and applications." View Article PubMed/NCBI Google Scholar (2008).</ref> gi ...

{{Short description|Cycles in a graph that generate all cycles}} In [[graph theory]], a branch of mathematics, a '''cycle basis''' of an [[undi ...

...haded regions indicate four cliques that cover all the edges of the graph. In an intersection representation, each vertex can be represented by the subse ...ntation of <math>G</math> as an [[intersection graph]] of [[finite set]]s. In such a representation, each vertex is represented as a set, and two vertice ...

In [[polyhedral combinatorics]], a branch of mathematics, '''Steinitz's theore ...eometry of these shapes.{{r|malkevitch}} Additionally, it has been applied in [[graph drawing]], as a way to construct three-dimensional visualizations o ...