804 search results - page 11 / 161 » Experiments on Union-Find Algorithms for the Disjoint-Set Da... |
MVA
2010
13 years 6 months ago
2010
In this paper, an unsupervised learning algorithm, neighborhood linear embedding (NLE), is proposed to discover the intrinsic structures such as neighborhood relationships, global ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
DMIN
2006
13 years 9 months ago
2006
Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...
ACL
2012
11 years 10 months ago
2012
This paper presents a novel top-down headdriven parsing algorithm for data-driven projective dependency analysis. This algorithm handles global structures, such as clause and coor...
IJCAI
2001
13 years 9 months ago
2001
The task of causal structure discovery from empirical data is a fundamental problem in many areas. Experimental data is crucial for accomplishing this task. However, experiments a...