Sciweavers

2111 search results - page 150 / 423
» Understanding the Yarowsky Algorithm
Sort
View
WCE
2007
14 years 11 months ago
The Jacobi Method in Reconfigurable Hardware
—Linear equations provide useful tools for understanding the behavior of a wide variety of phenomena— from science and engineering to social sciences. A number of techniques ha...
Safaa J. Kasbah, Issam W. Damaj
CADE
2010
Springer
14 years 11 months ago
Premise Selection in the Naproche System
Abstract. Automated theorem provers (ATPs) struggle to solve problems with large sets of possibly superfluous axiom. Several algorithms have been developed to reduce the number of ...
Marcos Cramer, Peter Koepke, Daniel Kühlwein,...
ICML
2010
IEEE
14 years 11 months ago
Accelerated dual decomposition for MAP inference
Approximate MAP inference in graphical models is an important and challenging problem for many domains including computer vision, computational biology and natural language unders...
Vladimir Jojic, Stephen Gould, Daphne Koller
CGA
2008
14 years 10 months ago
Legible Simplification of Textured Urban Models
Mesh simplification and discrete levels of detail (LOD) are wellstudied areas of research in computer graphics. However, until recently, most of the developed algorithms have focu...
Remco Chang, Thomas Butkiewicz, Caroline Ziemkiewi...
ENTCS
2007
81views more  ENTCS 2007»
14 years 10 months ago
Self-assembling Trees
RCCS is a variant of Milner’s CCS where processes are allowed a controlled form of backtracking. It turns out that the RCCS reinterpretation of a CCS process is equivalent, in t...
Vincent Danos, Jean Krivine, Fabien Tarissan