Sciweavers

2489 search results - page 357 / 498
» On the Subgroup Distance Problem
Sort
View
ICML
2010
IEEE
15 years 4 months ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
Philip M. Long, Rocco A. Servedio
CVPR
2010
IEEE
15 years 4 months ago
Fast directional chamfer matching
We study the object localization problem in images given a single hand-drawn example or a gallery of shapes as the object model. Although many shape matching algorithms have been ...
Ming-Yu Liu, Oncel Tuzel, Ashok Veeraraghavan, Ram...
AHSWN
2010
105views more  AHSWN 2010»
15 years 4 months ago
Optimal Gathering Algorithms in Multi-Hop Radio Tree-Networks with Interferences
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network,...
Jean-Claude Bermond, Min-Li Yu
117
Voted
CORR
2010
Springer
110views Education» more  CORR 2010»
15 years 3 months ago
Construction of Rational Surfaces Yielding Good Codes
In the present article, we consider algebraic geometry codes on some rational surfaces. The estimate of the minimum distance is translated into a point counting problem on plane cu...
Alain Couvreur
109
Voted
DAM
2008
82views more  DAM 2008»
15 years 3 months ago
Closest 4-leaf power is fixed-parameter tractable
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most r edge insertions or deletions such that it becomes a 4-leaf po...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...