Browsing 08 Information and Computing Sciences by Title

UTSePress Research/Manakin Repository

Search UTSePress Research


Advanced Search

Browse

My Account

  • UTSePress Research Home
  • >
  • 08 Information and Computing Sciences
  • >
  • Browsing 08 Information and Computing Sciences by Title

Browsing 08 Information and Computing Sciences by Title

Sort by: Order: Results:

  • A hierarchically combined classifier for license plate recognition 
    He Xiangjian; Zheng Lihong; Wu Qiang; Jia Wenjing; Samali Bijan; Palaniswami Marimuthu (IEEE Computer Society, 2008)
    High accuracy and fast recognition speed are two requirements for real-time and automatic license plate recognition system. In this paper, we propose a hierarchically combined classifier based on an inductive learning based ...
  • A Hierarchical VQSVM for Imbalanced Data Sets 
    Yu Ting; Jan Tony; Simoff Simeon; Debenham John (IEEE, 2007)
    First, a hierarchical modelling method, VQSVM, is introduced, and some remarks are discussed. Secondly the proposed VQSVM is applied to a nonstandard learning environment, imbalanced data sets. In cases of extremely ...
  • Higher order prediction for sub-pixel motion estimation 
    Yang Jie; Mudugamuwa Damith; Ahn Chung-Hyun; He Xiangjian (IEEE, 2009)
    NA
  • Highlighting in Information Visualization: A Survey 
    Liang Jie; Huang Mao (IEEE Computer Society, 2010)
    Highlighting was the basic viewing control mechanism in computer graphics and visualization to guide usersâ¿¿ attention in reading diagrams, images, graphs and digital texts. As the rapid growth of theory and practice in ...
  • A Highly Accurate Algorithm for the Estimation of the Frequency of a Complex Exponential in Additive Gaussian Noise 
    Reisenfeld Sam (Australian National University, 2004)
    A new algorithm for the precise estimation of the frequency of a complex exponential signal ill additive, complex, white Gaussian noise is presented. The algorithm has low computational complexity and is well suited for ...
  • A Highly Accurate DTF-Based Parameter Estimator for Complex Exponential 
    Tsui Jeffrey; Reisenfeld Sam (National Institute of Telecommunications, 2006)
    A highly accurate DFT-based complex exponential parameter estimation algorithm is presented in this paper. It will be shown that for large number of samples and high signal to noise ratio (SNR), the phase estimation error ...
  • High-Speed Feature Extraction in Sensor Coordinates for Laser Rangefinders 
    Alempijevic Alen (ARAA (Australian Robotics & Automation Association), 2004)
    The main contributions of this paper are two algorithms for extracting lines and comers present in the environment from information gathered by a laser rangefinder. The laser range scan is processed in its natural ...
  • Histogram-Based Training Initialisation of Hidden Markov Models for Human Action Recognition 
    Moghaddam Zia; Piccardi Massimo (IEEE Computer Society - Conference Publishing Services (CPS), 2010)
    Human action recognition is often addressed by use of latent-state models such as the hidden Markov model and similar graphical models. As such models require Expectation-Maximisation training, arbitrary choices must be ...
  • A history record-based service optimization method for QoS-aware service composition 
    Wenmin Lin; Wanchun Don; Xiangfeng Luo; Chen Jinjun (IEEE, 2011)
    The performance of a service's QoS may evolve relatively frequently with its internal changes or the changes of dynamic Internet environment, especially when some"intentional" deceptions are taken into consideration. ...
  • HMM-based graph edit distance for image indexing 
    Xiao Bing; Gao Xinbo; Tao Dacheng; Li Xuelong (John Wiley & Sons Inc, 2008)
    Most of the existing graph edit distance (GED) algorithms require cost functions which are difficult to be defined exactly. In this article, we propose a cost function free algorithm for computing GED. It only depends on ...
  • HMM-MIO: An Enhanced Hidden Markov Model for Action Recognition 
    Concha Oscar; Xu Yi Da; Piccardi Massimo; Moghaddam Zia (IEEE Computer Society, 2011)
    Generative models can be flexibly employed in a variety of tasks such as classification, detection and segmen- tation thanks to their explicit modelling of likelihood functions. However, likelihood functions are hard to ...
  • HMXT-GP: an information-theoretic approach to genetic programming that maintains diversity 
    Santosa Henry; Milton John; Kennedy Paul (Association for Computing Machinery, 2011)
    This paper applies a recent information¿theoretic approach to controlling Genetic Algorithms (GAs) called HMXT to tree¿based Genetic Programming (GP). HMXT, in a GA domain, requires the setting of selection thresholds in ...
  • Holonic Modelling of Business Process Management 
    Rahali Essam; Chong Wei; Chaczko Zenon; Braun Robin (IEEE Xplore, 2011)
    This paper discusses experiences of applying a Holonic approach for Modelling the Business Process Management (BPM) in the telecommunication domain. Topics presented in this paper include shared experiences as well as ...
  • Home alone: the role of technology in telecommuting 
    Baker Ellen; Avery Gayle; Crawford John (John Benjamins Publishing Co., 2003)
  • The Honourable Negotiator: When the Relationship Is What Matters 
    Debenham John; Simoff Simeon (Springer Verlag, 2010)
    Relationships are fundamental to all but the most impersonal forms of interaction in business. Human agents who are unsure of themselves seek honourable trading relationships. The establishment and growth of interpersonal ...
  • How Can Discussion Forum Questions Be Effective In Online MBA Courses? 
    Strang Kenneth (Emerald, 2011)
    Purpose: A quasi-experiment compared two instructional approaches for an existing MBA online business strategy course at an accredited university to answer the question: how can discussion questions become more effective ...
  • How Can Spiral Architecture Improve Image Compression? 
    He Xiangjian; Wang Huaqing; Hintz Thomas; Wu Qiang (Macquarie Scientific Publishing, 2004)
    An image file contains a large amount of data. Image compression changes a large image file into a much smaller file. Smaller files require less memory to store, less computer network bandwidth to transfer on the Internet, ...
  • How do Consumers Search for and Appraise Information on Medicines on the Internet? A Qualitative Study Using Focus Groups 
    Peterson G; Aslani P; Williams Kylie (Journal Medical Internet Research, 2003)
    Background Many consumers use the Internet to find information about their medicines. It is widely acknowledged that health information on the Internet is of variable quality and therefore the search and appraisal skills ...
  • How Does Research Evolve? Pattern Mining for Research Meme Cycles 
    He Dan; Zhu Xingquan; Stott Parker D (IEEE, 2011)
    Recent years have witnessed a great deal of attention in tracking news memes over the web, modeling shifts in the ebb and flow of their popularity. One of the most important features of news memes is that they seldom occur ...
  • How far is SLAM from a linear least squares problem? 
    Huang Shoudong; Lai Yingwu; Frese Udo; Dissanayake Gamini (IEEE, 2010)
    Most people believe SLAM is a complex nonlinear stimation/optimization problem. However, recent research shows that some simple iterative methods based on linearization can sometimes provide surprisingly good solutions to ...