3894 search results - page 740 / 779 » Approximation Algorithms for Biclustering Problems |
107
click to vote
TIT
2008
14 years 11 months ago
2008
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
104
click to vote
CAD
2005
Springer
14 years 11 months ago
2005
Springer
Subdivision surfaces are generated by repeated approximation or interpolation from initial control meshes. In this paper, two new nonlinear subdivision schemes, face based subdivi...
113
click to vote
CIKM
2010
Springer
14 years 10 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
113
click to vote
ICRA
2009
IEEE
14 years 9 months ago
2009
IEEE
In Simultaneous Localisation and Mapping (SLAM), it is well known that probabilistic filtering approaches which aim to estimate the robot and map state sequentially suffer from poo...
127
click to vote
MMAS
2011
Springer
14 years 6 months ago
2011
Springer
While existing mathematical descriptions can accurately account for phenomena at microscopic scales (e.g. molecular dynamics), these are often high-dimensional, stochastic and thei...