Sciweavers

2004 search results - page 121 / 401
» Sampling from large graphs
Sort
View
PR
2007
81views more  PR 2007»
15 years 2 months ago
Graph embedding using tree edit-union
In this paper we address the problem of how to learn a structural prototype that can be used to represent the variations present in a set of trees. The prototype serves as a patte...
Andrea Torsello, Edwin R. Hancock
ECML
2007
Springer
15 years 9 months ago
Dual Strategy Active Learning
Abstract. Active Learning methods rely on static strategies for sampling unlabeled point(s). These strategies range from uncertainty sampling and density estimation to multi-factor...
Pinar Donmez, Jaime G. Carbonell, Paul N. Bennett
ICDE
2008
IEEE
203views Database» more  ICDE 2008»
16 years 4 months ago
Training Linear Discriminant Analysis in Linear Time
Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. It has been widely used in many fields of information proces...
Deng Cai, Xiaofei He, Jiawei Han
CCGRID
2006
IEEE
15 years 9 months ago
Nexus: A Novel Weighted-Graph-Based Prefetching Algorithm for Metadata Servers in Petabyte-Scale Storage Systems
Abstract— An efficient, accurate and distributed metadataoriented prefetching scheme is critical to the overall performance in large distributed storage systems. In this paper, ...
Peng Gu, Yifeng Zhu, Hong Jiang, Jun Wang
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
15 years 6 months ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...