专利检索 ap:("Mingjin Zhang" OR "Naphtali Rishe" OR "Jahkell Lazarre") AND inv:"Jahkell Lazarre" 第 1 页

1.

发明授权
Window query monitoring for mobile devices and central database servers with a tree-like index 有权

公开(公告)号：US10210272B1

公开(公告)日：2019-02-19

申请号：US15822667

申请日：2017-11-27

申请人： Mingjin Zhang , Naphtali Rishe , Jahkell Lazarre

发明人： Mingjin Zhang , Naphtali Rishe , Jahkell Lazarre , Tao Li

IPC分类号： G06F17/30

摘要： Systems and methods for performing a mobile window query are provided. A method can include transmitting a mobile window query, determining which interest point falls within a query window, defining a potential safe region, refining the safe region utilizing the surrounding interest points, and returning the interest points and safe region to a user.

2.

发明授权
Voronoi diagram-based algorithm for efficient progressive continuous k-nearest neighbor query for moving objects 有权

公开(公告)号：US10200814B1

公开(公告)日：2019-02-05

申请号：US15960797

申请日：2018-04-24

申请人： Mingjin Zhang , Naphtali Rishe , Weitong Liu , Jahkell Lazarre

发明人： Mingjin Zhang , Naphtali Rishe , Weitong Liu , Jahkell Lazarre , Tao Li

IPC分类号： G06F17/30 , H04W4/021 , G06K9/62

摘要： Methods and apparatuses for providing a k-nearest neighbor for location based services are provided. A method can include querying a database to detect a plurality of interest points within a predetermined distance of the user device using a kNN algorithm, organizing the interest points within a Voronoi tree, and continuously return a position specific result of relevant interest points.

3.

发明授权
Voronoi-based efficient algorithm for range query monitoring for mobile devices and central database servers 有权

公开(公告)号：US10346477B1

公开(公告)日：2019-07-09

申请号：US15945255

申请日：2018-04-04

申请人： Mingjin Zhang , Naphtali Rishe , Jahkell Lazarre , Jing Tong

发明人： Mingjin Zhang , Naphtali Rishe , Jahkell Lazarre , Tao Li

IPC分类号： G06F16/901 , G06F16/9038 , G06N20/00

摘要： Systems and methods for performing a mobile range query are provided. A system can include a first computer readable medium configured to iteratively transmit a mobile range query, as well as a second computer readable medium configured to: receive a mobile range query; compute a range query result; build two min-heaps that contain in-border interest points and out-border intersect points respectively; construct an initial candidate safe region by popping top elements in the two min-heaps while they are not empty; computing the intersections of the domain region of the top elements and the candidate safe region and redefining the candidate safe region using the intersections; and return the mobile range query results to the first medium.