Sciweavers

4850 search results - page 129 / 970
» Approximate Data Structures with Applications
Sort
View
ER
2006
Springer
112views Database» more  ER 2006»
15 years 1 months ago
A DAG Comparison Algorithm and Its Application to Temporal Data Warehousing
Abstract. We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of chang...
Johann Eder, Karl Wiggisser
CPM
1999
Springer
129views Combinatorics» more  CPM 1999»
15 years 2 months ago
On the Structure of Syntenic Distance
This paper examines some of the rich structure of the syntenic distance model of evolutionary distance, introduced by Ferretti et al. (1996). The syntenic distance between two gen...
David Liben-Nowell
CBMS
2006
IEEE
15 years 4 months ago
Incoporating Data Mining Applications into Clinical Guildelines
Computer based clinical guidelines have been developed to help caregivers in practicing medicine. GLIF3 (Guideline Interchange Format 3) is one of several standards that specify t...
Reza Sherafat Kazemzadeh, Kamran Sartipi
ACSW
2004
14 years 11 months ago
Application of self-organizing maps to clustering of high-frequency Financial data
This paper analyzes the clustering of trades on the Australian Stock Exchange (ASX) with respect to the trade direction variable. The ASX is a limit order market operating an elec...
Adam Blazejewski, Richard Coggins
MVA
2010
130views Computer Vision» more  MVA 2010»
14 years 8 months ago
Neighborhood linear embedding for intrinsic structure discovery
In this paper, an unsupervised learning algorithm, neighborhood linear embedding (NLE), is proposed to discover the intrinsic structures such as neighborhood relationships, global ...
Shuzhi Sam Ge, Feng Guan, Yaozhang Pan, Ai Poh Loh