Sciweavers

6266 search results - page 60 / 1254
» New results on the computability and complexity of points - ...
Sort
View
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
14 years 27 days ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
SIGECOM
2006
ACM
184views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
Computing pure nash equilibria in graphical games via markov random fields
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
Constantinos Daskalakis, Christos H. Papadimitriou
COMPGEOM
2003
ACM
14 years 2 months ago
Estimating surface normals in noisy point cloud data
In this paper we describe and analyze a method based on local least square fitting for estimating the normals at all sample points of a point cloud data (PCD) set, in the presenc...
Niloy J. Mitra, An Nguyen
VIS
2007
IEEE
239views Visualization» more  VIS 2007»
14 years 10 months ago
Moment Invariants for the Analysis of 2D Flow Fields
We present a novel approach for analyzing two-dimensional (2D) flow field data based on the idea of invariant moments. Moment invariants have traditionally been used in computer vi...
Michael Schlemmer, Manuel Heringer, Florian Morr...
MP
2006
138views more  MP 2006»
13 years 8 months ago
A new ILP-based refinement heuristic for Vehicle Routing Problems
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
Roberto De Franceschi, Matteo Fischetti, Paolo Tot...