Sciweavers

7123 search results - page 344 / 1425
» The Ordered Set of Rough Sets
Sort
View
DASFAA
2008
IEEE
109views Database» more  DASFAA 2008»
16 years 1 months ago
Bulk-Loading the ND-Tree in Non-ordered Discrete Data Spaces
Applications demanding multidimensional index structures for performing efficient similarity queries often involve a large amount of data. The conventional tuple-loading approach t...
Hyun-Jeong Seok, Gang Qian, Qiang Zhu, Alexander R...
ICPR
2008
IEEE
16 years 1 months ago
On the selection of base prototypes for LAESA and TLAESA classifiers
—The k nearest neighbor (k-NN) classifier has been extensively used as a nonparametric technique in Pattern Recognition. However, in some applications where the training set is l...
Selene Hernández-Rodríguez, Jos&eacu...
CGO
2007
IEEE
16 years 1 months ago
Rapidly Selecting Good Compiler Optimizations using Performance Counters
Applying the right compiler optimizations to a particular program can have a significant impact on program performance. Due to the non-linear interaction of compiler optimization...
John Cavazos, Grigori Fursin, Felix V. Agakov, Edw...
ATAL
2007
Springer
16 years 29 days ago
Incentive compatible ranking systems
Ranking systems are a fundamental ingredient of multi-agent environments and Internet Technologies. These settings can be viewed as social choice settings with two distinguished p...
Alon Altman, Moshe Tennenholtz
153
Voted
MICAI
2007
Springer
16 years 27 days ago
Variants of Tree Kernels for XML Documents
In this paper, we discuss tree kernels that can be applied for the classification of XML documents based on their DOM trees. DOM trees are ordered trees, in which every node might...
Peter Geibel, Helmar Gust, Kai-Uwe Kühnberger