Sciweavers

384 search results - page 29 / 77
» Equivalence Relations on Classes of Computable Structures
Sort
View
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
14 years 8 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
EWCBR
1998
Springer
13 years 12 months ago
Similarity Measures for Object-Oriented Case Representations
Object-oriented case representations require approaches for similarity assessment that allow to compare two differently structured objects, in particular, objects belonging to diff...
Ralph Bergmann, Armin Stahl
IJRR
2008
100views more  IJRR 2008»
13 years 7 months ago
Comparing the Power of Robots
Robots must complete their tasks in spite of unreliable actuators and limited, noisy sensing. In this paper, we consider the information requirements of such tasks. What sensing a...
Jason M. O'Kane, Steven M. LaValle
CVPR
2008
IEEE
14 years 9 months ago
Exploiting side information in locality preserving projection
Even if the class label information is unknown, side information represents some equivalence constraints between pairs of patterns, indicating whether pairs originate from the sam...
Senjian An, Wanquan Liu, Svetha Venkatesh
CIE
2010
Springer
13 years 8 months ago
Computable Ordered Abelian Groups and Fields
Abstract. We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, w...
Alexander G. Melnikov