1974 search results - page 100 / 395 » On Unbiased Linear Approximations |
75
Voted
IJCNN
2007
IEEE
15 years 7 months ago
2007
IEEE
— In this article, we apply the competitive associative net called CAN2 to the processing of the range data of indoor environment acquired by a mobile robot, where the CAN2 is a ...
ICRA
2006
IEEE
15 years 6 months ago
2006
IEEE
Abstract— We consider the problem of approximating a continuous curve by a piecewise linear one whose segments are assumed to be connected by universal joints. Rather than taking...
103
click to vote
FOCS
2005
IEEE
15 years 6 months ago
2005
IEEE
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 − O(1/ log n), satisfies a constant fraction of constraints, wher...
128
click to vote
ATAL
2008
Springer
15 years 2 months ago
2008
Springer
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...
87
Voted
DSD
2010
IEEE
15 years 27 days ago
2010
IEEE
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...