903 search results - page 25 / 181 » Non-well-founded trees in categories |
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
113
click to vote
SIGIR
2011
ACM
14 years 2 months ago
2011
ACM
A key challenge in recommender system research is how to effectively profile new users, a problem generally known as cold-start recommendation. Recently the idea of progressivel...
195
click to vote
DAC
2011
ACM
13 years 11 months ago
2011
ACM
Clock tree synthesis is one of the most important and challenging problems in 3D ICs. The clock signals have to be delivered by through-silicon vias (TSVs) to different tiers with...
EMNLP
2008
15 years 1 months ago
2008
Most state-of-the-art wide-coverage parsers are trained on newspaper text and suffer a loss of accuracy in other domains, making parser adaptation a pressing issue. In this paper ...
ENTCS
2011
14 years 6 months ago
2011
d abstract) Andr´e Joyal 1 D´epartement des math´ematiques Universit´e du Qu´ebec `a Montr´eal Canada Joachim Kock 2 3 Departament de matem`atiques Universitat Aut`onoma de B...