3894 search results - page 559 / 779 » Approximation Algorithms for Biclustering Problems |
117
click to vote
NIPS
2007
15 years 5 months ago
2007
We investigate a new, convex relaxation of an expectation-maximization (EM) variant that approximates a standard objective while eliminating local minima. First, a cautionary resu...
136
click to vote
AAAI
1996
15 years 5 months ago
1996
In recent years, compositional modeling and selfexplanatory simulation techniques have simplified the process of building dynamic simulators of physical systems. Building steady-s...
152
Voted
GRC
2010
IEEE
15 years 4 months ago
2010
IEEE
We present a problem of factor analysis of three-way binary data, i.e. data described by a 3-dimensional binary matrix I, describing a relationship between objects, attributes, an...
162
click to vote
HICSS
2008
IEEE
15 years 4 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
146
Voted
AROBOTS
2006
15 years 3 months ago
2006
This paper aims at a discussion of the structure of the SLAM problem. The analysis is not strictly formal but based both on informal studies and mathematical derivation. The first ...