16504 search results - page 152 / 3301 » New Problems, New Solutions |
165
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
— Contact dynamics are commonly formulated as a linear complementarity problem. While this approach is superior to earlier spring-damper models, it can be inaccurate due to pyram...
157
click to vote
DCC
2004
IEEE
16 years 6 months ago
2004
IEEE
We introduce three new innovations for compression using LDPCs for the Slepian-Wolf problem. The first is a general iterative Slepian-Wolf decoding algorithm that incorporates the...
150
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We propose a new graph-based label propagation algorithm for transductive learning. Each example is associated with a vertex in an undirected graph and a weighted edge be...
163
click to vote
COMPGEOM
2004
ACM
15 years 12 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
166
click to vote
EUROPAR
1999
Springer
15 years 10 months ago
1999
Springer
Recently, a number of graph partitioning applications have emerged with additional requirements that the traditional graph partitioning model alone cannot e ectively handle. One s...