4137 search results - page 506 / 828 » On the number of matchings of a tree |
205
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
Instance selection and feature selection are two orthogonal methods for reducing the amount and complexity of data. Feature selection aims at the reduction of redundant features i...
198
click to vote
EDBT
2008
ACM
16 years 7 months ago
2008
ACM
Music information retrieval is becoming very important with the ever-increasing growth of music content in digital libraries, peer-to-peer systems and the internet. While it is ea...
168
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We present the first adaptive data structure for two-dimensional orthogonal range search. Our data structure is adaptive in the sense that it gives improved search perfo...
165
click to vote
ACSAC
2005
IEEE
16 years 13 days ago
2005
IEEE
We apply adjacency matrix clustering to network attack graphs for attack correlation, prediction, and hypothesizing. We self-multiply the clustered adjacency matrices to show atta...
177
click to vote
CCGRID
2003
IEEE
16 years 3 days ago
2003
IEEE
High-performance peer-to-peer transfer between clusters will be fundamental technology base for various Grid middleware, such as large-scale data transfer in DataGrid settings, or...