Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mohammad R. Kolahdouzan

dblp:72/5849 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
0since 2021 · last 2008
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 6 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
3 papers
Spatial and temporal data management · 86% Data integration and cleaning · 14%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Spatial and temporal data management
spatial query processing
0.112008
The optimal sequenced route query · VLDB J. 2008
Spatial and temporal data management › spatial query processing › nearest neighbor query
k-nearest neighbor query
0.012004
Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases · VLDB 2004
Spatial and temporal data management › spatial databases
spatial network databases
0.012004
Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases · VLDB 2004
Spatial and temporal data management
spatial indexing
0.012004
Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases · VLDB 2004

Methods — techniques the papers use, named apart from their topics

voronoi diagram · 0.0
YearPublicationVenuePosition
2008 The optimal sequenced route query
Mehdi Sharifzadeh, Mohammad R. Kolahdouzan, Cyrus Shahabi
VLDB J.2
2005 Alternative Solutions for Continuous K Nearest Neighbor Queries in Spatial Network Databases
Mohammad R. Kolahdouzan, Cyrus Shahabi
GeoInformatica1
2004 Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases
Mohammad R. Kolahdouzan, Cyrus Shahabi
VLDB1
2004 Alternative strategies for Performing Spatial Joins on Web Sources
Cyrus Shahabi, Mohammad R. Kolahdouzan, Maytham Safar
Knowl. Inf. Syst.2
2003 A Road Network Embedding Technique for K-Nearest Neighbor Search in Moving Object Databases
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Sharifzadeh
GeoInformatica2
2002 A comparison of different haptic compression techniques
abstract
Immersive environments provide an artificial world to surround users. These environments consist of a composition of various types of immersidata: unique data types that are combined to render a virtual experience. To construct such an environment, immersidata acquisition is indispensable for storage and future query. However, this is challenging because of the real time demands and sizeable amounts of data to be managed. We propose and evaluate alternative techniques for achieving efficient sampling and compression of one immersidata type, the haptic data, which describes the movement, rotation, and force associated with user-directed objects in an immersive environment. Our experiments identify the benefits and limitations of various techniques in terms of their data storage, bandwidth and accuracy.
Cyrus Shahabi, Antonio Ortega, Mohammad R. Kolahdouzan
ICME (1)3
2001 The WorlInfo Assistant: Spatio-Temporal Information Integration on the Web
José Luis Ambite, Craig A. Knoblock, Mohammad R. Kolahdouzan, Maria Muslea, Cyrus Shahabi, Snehal Thakkar
VLDB3