Sciweavers

1000 search results - page 99 / 200
» Dependency Tree Automata
Sort
View
120
Voted
DMIN
2006
143views Data Mining» more  DMIN 2006»
15 years 2 months ago
Reverse Tree Clustering
Common document clustering algorithms utilize models that either divide a corpus into smaller clusters or gather individual documents into clusters. Hierarchical Agglomerative Clus...
Casey Bartman, Jamal R. Alsabbagh
101
Voted
SODA
2004
ACM
111views Algorithms» more  SODA 2004»
15 years 2 months ago
Fast mixing for independent sets, colorings and other models on trees
We study the mixing time of the Glauber dynamics for general spin systems on bounded-degree trees, including the Ising model, the hard-core model (independent sets) and the antife...
Fabio Martinelli, Alistair Sinclair, Dror Weitz
NAACL
1994
15 years 2 months ago
Tree-Based State Tying for High Accuracy Modelling
The key problem to be faced when building a HMM-based continuous speech recogniser is maintaining the balance between model complexity and available training data. For large vocab...
S. J. Young, J. J. Odell, Philip C. Woodland
104
Voted
ISVC
2007
Springer
15 years 7 months ago
Fast kd -Tree Construction for 3D-Rendering Algorithms Like Ray Tracing
Many computer graphics rendering algorithms and techniques use ray tracing for generation of natural and photo-realistic images. The efficiency of the ray tracing algorithms depend...
Sajid Hussain, Håkan Grahn
101
Voted
ISIPTA
2003
IEEE
102views Mathematics» more  ISIPTA 2003»
15 years 6 months ago
A Sensitivity Analysis for the Pricing of European Call Options in a Binary Tree Model
The European call option prices have well-known formulae in the Cox-RossRubinstein model [2], depending on the volatility of the underlying asset. Nevertheless it is hard to give ...
Huguette Reynaerts, Michèle Vanmaele