Browsing 08 Information and Computing Sciences by Author "Lin, Xuemin"

UTSePress Research/Manakin Repository

Search UTSePress Research


Advanced Search

Browse

My Account

  • >
  • >

Browsing 08 Information and Computing Sciences by Author "Lin, Xuemin"

Sort by: Order: Results:

  • Lin, Qianlu; Zhang, Ying; Zhang, Wenjie; Lin, Xuemin (Springer, 2013)
    In the paper, we study the problems of nearest neighbor queries (NN) and all nearest neighbor queries (ANN) on location data, which have a wide range of applications such as Geographic Information System (GIS) and Location ...
  • Zhu, Ke; Zhang, Wenjie; Zhu, Gaoping; Zhang, Ying; Lin, Xuemin (Springer, 2011)
    Reachability query is a fundamental problem in graph databases. It answers whether or not there exists a path between a source vertex and a destination vertex and is widely used in various applications including road ...
  • Shang, Haichuan; Lin, Xuemin; Zhang, Ying; Yu, Jeffrey; Wang, Wei (ACM, 2010)
    Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical compounds. The problem is challenging as even ...
  • Zhang, Wenjie; Zhang, Ying; Cheema, Muhammad; Lin, Xuemin (ACM, 2010)
    Aggregation against distinct objects has been involved in many real applications with the presence of duplicates, including real-time monitoring moving objects. In this paper, we investigate the problem of counting distinct ...
  • Zhang, Ying; Lin, Xuemin; Yuan, Yidong; Kitsuregawa, Masaru; Zhou, Xiaofang; Yu, Jeffrey (IEEE, 2010)
    Duplicates in data streams may often be observed by the projection on a subspace and/or multiple recordings of objects. Without the uniqueness assumption on observed data elements, many conventional aggregates computation ...
  • Zhang, Ying; Zhang, Wenjie; Lin, Qianlu; Lin, Xuemin (ACM, 2012)
    The range searching problem is fundamental in a wide spectrum of applications such as radio frequency identification (RFID) networks, location based services (LBS), and global position system (GPS). As the uncertainty is ...
  • Zhang, Ying; Lin, Xuemin; Zhang, Wenjie; Wang, Jianmin; Lin, Qianlu (IEEE, 2010)
    With the rapid development of various optical, infrared, and radar sensors and GPS techniques, there are a huge amount of multidimensional uncertain data collected and accumulated everyday. Recently, considerable research ...
  • Wang, Wei; Xiao, Chuan; Lin, Xuemin; Zhang, Chengqi (ACM, 2009)
    Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respect to a large dictionary of known entities, ...
  • Zhang, Ying; Lin, Xuemin; Tao, Yufei; Zhang, Wenjie; Wang, Haixun (IEEE, 2012)
    In many applications, including location-based services, queries may not be precise. In this paper, we study the problem of efficiently computing range aggregates in a multidimensional space when the query location is ...
  • Hasan, Mahady; Cheema, Muhammad; Lin, Xuemin; Zhang, Ying (Springer, 2009)
    The concept of safe region has been used to reduce the computation and communication cost for the continuous monitoring of k nearest neighbor (kNN) queries. A safe region is an area such that as long as a query remains in ...
  • Lin, Qianlu; Zhang, Ying; Zhang, Wenjie; Lin, Xuemin (Springer, 2013)
    With the emergence of location-aware mobile device technologies, communication technologies and GPS systems, the location based queries have attracted great attentions in the database literature. In many user recommendation ...
  • Chang, Lijun; Lin, Xuemin; Qin, Lu; Liu, Chengfei; Liang, Weifa (ACM, 2013)
    k-edge connected components; graph decomposition; minimum cut
  • Zhang, Ying; Lin, Xuemin; Zhu, Gaoping; Zhang, Wenjie; Lin, Qianlu (IEEE, 2010)
    Uncertain data are inherent in many applications such as environmental surveillance and quantitative economics research. As an important problem in many applications, KNN query has been extensively investigated in the ...
  • Ding, Bolin; Yu, Jeffrey; Wang, Shan; Qin, Lu; Zhang, Xiao; Lin, Xuemin (IEEE, 2007)
    It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study processing an l-keyword query, p1, p1, ..., ...
  • Zhan, Liming; Zhang, Ying; Zhang, Wenjie; Lin, Xuemin (ACM, 2012)
    Uncertainty is inherent in many important applications, such as location-based services (LBS), sensor monitoring and radio-frequency identification (RFID). Recently, considerable research efforts have been put into the ...
  • Zhu, Yuanyuan; Qin, Lu; Yu, Jeffrey; Ke, Yiping; Lin, Xuemin (Elsevier, 2013)
    Graph matching plays an essential role in many real applications. In this paper, we study how to match two large graphs by maximizing the number of matched edges, which is known as maximum common subgraph matching and is ...
  • Cheema, Muhammad; Lin, Xuemin; Zhang, Wenjie; Zhang, Ying (IEEE, 2011)
    Given a set of objects and a query q, a point p is called the reverse k nearest neighbor (RkNN) of q if q is one of the k closest objects of p. In this paper, we introduce the concept of influence zone which is the area ...
  • Zhang, Chenyuan; Zhang, Ying; Zhang, Wenjie; Lin, Xuemin (IEEE, 2013)
    With advances in geo-positioning technologies and geo-location services, there are a rapidly growing amount of spatio-textual objects collected in many applications such as location based services and social networks, in ...
  • Zhang, Zhiwei; Yu, Jeffrey; Qin, Lu; Chang, Lijun; Lin, Xuemin (ACM, 2013)
    A strongly connected component (SCC) is a maximal subgraph of a directed graph G in which every pair of nodes are reachable from each other in the SCC. With such a property, a general directed graph can be represented by ...
  • Cheema, Muhammad; Lin, Xuemin; Zhang, Ying; Wang, Wei; Zhang, Wenjie (ACM, 2009)
    In this paper, we study the problem of continuous monitoring of reverse k nearest neighbor queries. Existing continuous reverse nearest neighbor monitoring techniques are sensitive towards objects and queries movement. For ...