Sciweavers

1326 search results - page 230 / 266
» Approximate Tree Kernels
Sort
View
ACL
2006
15 years 3 months ago
Morphological Richness Offsets Resource Demand - Experiences in Constructing a POS Tagger for Hindi
In this paper we report our work on building a POS tagger for a morphologically rich language- Hindi. The theme of the research is to vindicate the stand that- if morphology is st...
Smriti Singh, Kuhoo Gupta, Manish Shrivastava, Pus...
CIC
2004
118views Communications» more  CIC 2004»
15 years 3 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng
BMCBI
2010
178views more  BMCBI 2010»
15 years 2 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
BMCBI
2008
140views more  BMCBI 2008»
15 years 2 months ago
FUNYBASE: a FUNgal phYlogenomic dataBASE
Background: The increasing availability of fungal genome sequences provides large numbers of proteins for evolutionary and phylogenetic analyses. However the heterogeneity of data...
Sylvain Marthey, Gabriela Aguileta, Françoi...
COMGEO
2006
ACM
15 years 2 months ago
Octrees with near optimal cost for ray-shooting
Predicting and optimizing the performance of ray shooting is a very important problem in computer graphics due to the severe computational demands of ray tracing and other applica...
Hervé Brönnimann, Marc Glisse