Sciweavers

264 search results - page 32 / 53
» On the possibility of faster SAT algorithms
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
Extensions of recurrent neural network language model
We present several modifications of the original recurrent neural network language model (RNN LM). While this model has been shown to significantly outperform many competitive l...
Tomas Mikolov, Stefan Kombrink, Lukas Burget, Jan ...
ICRA
2007
IEEE
150views Robotics» more  ICRA 2007»
15 years 4 months ago
Enhancing Software Modularity and Extensibility: A Case for using Generic Data Representations
— Portable, modular and extensible software allows robotics researchers to pool their resources by sharing algorithms, thus advancing research in the field of robotics at a fast...
Gregory Broten
ECCV
2010
Springer
15 years 3 months ago
Energy Minimization Under Constraints on Label Counts
Abstract. Many computer vision problems such as object segmentation or reconstruction can be formulated in terms of labeling a set of pixels or voxels. In certain scenarios, we may...
68
Voted
CGF
2008
114views more  CGF 2008»
14 years 10 months ago
Displacement Mapping on the GPU - State of the Art
This paper reviews the latest developments of displacement mapping algorithms implemented on the vertex, geometry, and fragment shaders of graphics cards. Displacement mapping alg...
László Szirmay-Kalos, Tamás U...
82
Voted
ICDM
2010
IEEE
127views Data Mining» more  ICDM 2010»
14 years 8 months ago
Learning Markov Network Structure with Decision Trees
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
Daniel Lowd, Jesse Davis