3607 search results - page 474 / 722 » Learning with structured sparsity |
194
click to vote
ICML
1994
IEEE
15 years 10 months ago
1994
IEEE
Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. Yet in ...
178
click to vote
EDUTAINMENT
2008
Springer
15 years 8 months ago
2008
Springer
Hyperlinks among webpages are very important information and are widely used for webpage clustering and webpage ranking. With the explosive growth in the number of webpages availab...
172
click to vote
EMNLP
2008
15 years 8 months ago
2008
We explore a stacked framework for learning to predict dependency structures for natural language sentences. A typical approach in graph-based dependency parsing has been to assum...
149
click to vote
LREC
2008
15 years 8 months ago
2008
Accessing structured data in the form of ontologies requires training and learning formal query languages (e.g., SeRQL or SPARQL) which poses significant difficulties for non-expe...
197
click to vote
UAI
2008
15 years 8 months ago
2008
Identifying co-varying causal elements in very high dimensional feature space with internal structures, e.g., a space with as many as millions of linearly ordered features, as one...