Sciweavers

2395 search results - page 471 / 479
» A comparative study of two object recognition methods
Sort
View
CORR
2006
Springer
135views Education» more  CORR 2006»
14 years 9 months ago
Classification of Ordinal Data
Many real life problems require the classification of items into naturally ordered classes. These problems are traditionally handled by conventional methods intended for the class...
Jaime S. Cardoso
BMCBI
2007
123views more  BMCBI 2007»
14 years 9 months ago
Robust clustering in high dimensional data using statistical depths
Background: Mean-based clustering algorithms such as bisecting k-means generally lack robustness. Although componentwise median is a more robust alternative, it can be a poor cent...
Yuanyuan Ding, Xin Dang, Hanxiang Peng, Dawn Wilki...
JSAT
2008
122views more  JSAT 2008»
14 years 9 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya
IWC
2007
120views more  IWC 2007»
14 years 9 months ago
Visualizing set concordance with permutation matrices and fan diagrams
Scientific problem solving often involves concordance (or discordance) analysis among the result sets from different approaches. For example, different scientific analysis met...
Bo Hyoung Kim, Bongshin Lee, Jinwook Seo
BMCBI
2002
131views more  BMCBI 2002»
14 years 9 months ago
Efficient Boolean implementation of universal sequence maps (bUSM)
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
John Schwacke, Jonas S. Almeida