3607 search results - page 246 / 722 » Learning with structured sparsity |
147
click to vote
ECTEL
2007
Springer
15 years 11 months ago
2007
Springer
—This paper presents a semiautomatic framework that aims to produce domain concept maps from text and then to derive domain ontologies from these concept maps. This methodology p...
165
click to vote
JMLR
2012
13 years 7 months ago
2012
Many real-world problems are inherently hierarchically structured. The use of this structure in an agent’s policy may well be the key to improved scalability and higher performa...
144
Voted
UAI
2000
15 years 6 months ago
2000
This paper is about the use of metric data structures in high-dimensionalor non-Euclidean space to permit cached sufficientstatisticsaccelerationsof learning algorithms. It has re...
167
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
153
Voted
PPOPP
2010
ACM
16 years 2 months ago
2010
ACM
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...