Developing Deep Learning Models For Multimedia Applications In Tensorflow | 0 | 0.34 | 2018 |
Structured Prediction Networks through Latent Cost Learning | 0 | 0.34 | 2018 |
Improving Relation Extraction by Using an Ontology Class Hierarchy Feature. | 0 | 0.34 | 2015 |
Latent trees for coreference resolution | 9 | 0.61 | 2014 |
Latent structure perceptron with feature induction for unrestricted coreference resolution | 41 | 1.23 | 2012 |
XHITS: Learning to Rank in a Hyperlinked Structure. | 0 | 0.34 | 2011 |
Data stream anomaly detection through principal subspace tracking | 19 | 0.91 | 2010 |
RelHunter: a machine learning method for relation extraction from text | 0 | 0.34 | 2010 |
XHITS - Multiple Roles in a Hyperlinked Structure | 0 | 0.34 | 2009 |
Phrase Chunking Using Entropy Guided Transformation Learning | 11 | 0.66 | 2008 |
Portuguese Corpus-Based Learning Using ETL | 4 | 0.48 | 2008 |
Evolutionary TBL Template Generation | 1 | 0.34 | 2007 |
Machine Learning Algorithms for Portuguese Named Entity Recognition | 1 | 0.50 | 2007 |
Probabilistic Classifications with TBL | 3 | 0.41 | 2007 |
TBL Template Selection: An Evolutionary Approach | 2 | 0.40 | 2007 |
A Multi-Agent Architecture for a Dynamic Supply Chain Management | 1 | 0.41 | 2006 |
Towards Gazetteer Integration Through an Instance-based Thesauri Mapping Approach | 7 | 0.59 | 2006 |
A machine learning approach to the identification of appositives | 6 | 0.52 | 2006 |
Semi-supervised learning for portuguese noun phrase extraction | 3 | 0.42 | 2006 |
An Agent Based Architecture for Highly Competitive Electronic Markets | 5 | 0.51 | 2005 |
On the incorporating of learning in open multi-agent systems: a systematic approach | 0 | 0.34 | 2004 |
The complexity of makespan minimization for pipeline transportation | 3 | 0.50 | 2003 |
Pipeline Transportation of Petroleum Products with No Due Dates | 6 | 0.97 | 2002 |
A strategy for searching with different access costs | 1 | 0.34 | 2002 |
Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products | 1 | 0.44 | 2002 |
An Object-Oriented Framework for Creating Offerings | 4 | 0.68 | 2001 |
Bounding the Inefficiency of Length-Restricted Prefix Codes | 11 | 0.70 | 2001 |
Adding security to compressed information retrieval systems | 1 | 0.63 | 2001 |
Linear Time Recognition of Optimal L-Restricted Prefix Codes (Extended Abstract) | 0 | 0.34 | 2000 |
The WARM-UP Algorithm: A Lagrangian Construction of Length Restricted Huffman Codes | 9 | 0.84 | 2000 |
Efficient Implementation of the WARM-UP Algorithm for the Construction of Length-Restricted Prefix Codes | 6 | 0.74 | 1999 |
Strategies for Searching with Different Access Costs | 4 | 0.54 | 1999 |
Bounding the compression loss of the FGK algorithm | 10 | 0.62 | 1999 |
In-place length-restricted prefix coding | 5 | 0.50 | 1998 |
Belief Function Model For Information-Retrieval | 14 | 1.41 | 1993 |
Algorithms for combining belief functions | 4 | 0.58 | 1992 |