default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Q. Rieck
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j11]Michael Q. Rieck
:
Geometric Conditions for the Existence or Non-existence of a Solution to the Perspective 3-Point Problem. J. Math. Imaging Vis. 66(1): 75-91 (2024)- 2021
- [j10]Michael Q. Rieck, Bo Wang:
Locating Perspective Three-Point Problem Solutions In Spatial Regions. J. Math. Imaging Vis. 63(8): 953-973 (2021) - 2018
- [j9]Michael Q. Rieck:
On the Discriminant of Grunert's System of Algebraic Equations and Related Topics. J. Math. Imaging Vis. 60(5): 737-762 (2018) - 2015
- [j8]Michael Q. Rieck:
Related Solutions to the Perspective Three-Point Pose Problem. J. Math. Imaging Vis. 53(2): 225-232 (2015) - 2014
- [j7]Michael Q. Rieck:
A Fundamentally New View of the Perspective Three-Point Pose Problem. J. Math. Imaging Vis. 48(3): 499-516 (2014) - 2012
- [j6]Michael Q. Rieck:
An Algorithm for Finding Repeated Solutions to the General Perspective Three-Point Pose Problem. J. Math. Imaging Vis. 42(1): 92-100 (2012) - 2009
- [j5]Michael Q. Rieck, Subhankar Dhar:
Constructing special k-dominating sets using variations on the greedy algorithm. Pervasive Mob. Comput. 5(1): 64-76 (2009) - 2008
- [j4]Michael Q. Rieck, Subhankar Dhar:
Hierarchical routing in ad hoc networks using k-dominating sets. ACM SIGMOBILE Mob. Comput. Commun. Rev. 12(3): 45-57 (2008) - 2005
- [j3]Michael Q. Rieck, Sukesh Pai, Subhankar Dhar:
Distributed routing algorithms for multi-hop ad hoc networks using d-hop connected d-dominating sets. Comput. Networks 47(6): 785-799 (2005) - [j2]Michael Q. Rieck:
Association schemes based on isotropic subspaces, Part 1. Discret. Math. 298(1-3): 301-320 (2005) - 2004
- [j1]Subhankar Dhar, Michael Q. Rieck, Sukesh Pai, Eun Jik Kim:
Distributed routing schemes for ad hoc networks using d-SPR sets. Microprocess. Microsystems 28(8): 427-437 (2004)
Conference and Workshop Papers
- 2012
- [c6]Michael Q. Rieck:
Solving the Three-point Camera Pose Problem in the Vicinity of the Danger Cylinder. VISAPP (2) 2012: 335-340 - 2010
- [c5]Michael Q. Rieck, Subhankar Dhar:
Efficient Multi-hop Broadcasting in Wireless Networks Using k-Shortest Path Pruning. ICDCN 2010: 283-294 - [c4]Michael Q. Rieck:
Handling Repeated Solutions to the Perspective Three-point Pose Problem. VISAPP (1) 2010: 395-399 - 2005
- [c3]Michael Q. Rieck, Subhankar Dhar:
Hierarchical Routing in Sensor Networks Using k-Dominating Sets. IWDC 2005: 306-317 - 2003
- [c2]Subhankar Dhar, Michael Q. Rieck, Sukesh Pai:
On Shortest Path Routing Schemes for Wireless Ad Hoc Networks. HiPC 2003: 130-141 - [c1]Subhankar Dhar, Michael Q. Rieck, Sukesh Pai, Eun Jik Kim:
Various Distributed Shortest Path Routing Strategies for Wireless Ad Hoc Networks. IWDC 2003: 255-265
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
