Sciweavers

SIGIR
2012
ACM
12 years 1 months ago
TwiNER: named entity recognition in targeted twitter stream
Many private and/or public organizations have been reported to create and monitor targeted Twitter streams to collect and understand users’ opinions about the organizations. Tar...
Chenliang Li, Jianshu Weng, Qi He, Yuxia Yao, Anwi...
COMGEO
2012
ACM
12 years 6 months ago
Point-set embeddings of plane 3-trees
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
Rahnuma Islam Nishat, Debajyoti Mondal, Md. Saidur...
EMNLP
2011
12 years 10 months ago
Training a Log-Linear Parser with Loss Functions via Softmax-Margin
Log-linear parsing models are often trained by optimizing likelihood, but we would prefer to optimise for a task-specific metric like Fmeasure. Softmax-margin is a convex objecti...
Michael Auli, Adam Lopez
ML
2010
ACM
159views Machine Learning» more  ML 2010»
13 years 9 months ago
Algorithms for optimal dyadic decision trees
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Don R. Hush, Reid B. Porter
JSAC
2006
100views more  JSAC 2006»
13 years 10 months ago
An improved algorithm for optimal lightpath establishment on a tree topology
Routing and wavelength assignment (RWA) aims to assign the limited number of wavelengths in a wavelength-division multiplexed (WDM) optical network so as to achieve greater capacit...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...
IJFCS
2006
91views more  IJFCS 2006»
13 years 10 months ago
Bit-parallel Computation of Local Similarity Score Matrices with Unitary Weights
Abstract. Local similarity computation between two sequences permits detecting all the relevant alignments present between subsequences thereof. A well-known dynamic programming al...
Heikki Hyyrö, Gonzalo Navarro
IANDC
2006
86views more  IANDC 2006»
13 years 10 months ago
Table design in dynamic programming
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
Peter Steffen, Robert Giegerich
BMCBI
2007
148views more  BMCBI 2007»
13 years 10 months ago
Computation of significance scores of unweighted Gene Set Enrichment Analyses
Background: Gene Set Enrichment Analysis (GSEA) is a computational method for the statistical evaluation of sorted lists of genes or proteins. Originally GSEA was developed for in...
Andreas Keller, Christina Backes, Hans-Peter Lenho...
PSB
2001
14 years 6 days ago
A Multithreaded Parallel Implementation of a Dynamic Programming Algorithm for Sequence Comparison
This paper discusses the issues involved in implementing a dynamic programming algorithm for biological sequence comparison on a generalpurpose parallel computing platform based o...
W. S. Martins, Juan del Cuvillo, F. J. Useche, Kev...
AAAI
2004
14 years 7 days ago
Dynamic Programming for Partially Observable Stochastic Games
We develop an exact dynamic programming algorithm for partially observable stochastic games (POSGs). The algorithm is a synthesis of dynamic programming for partially observable M...
Eric A. Hansen, Daniel S. Bernstein, Shlomo Zilber...