2168 search results - page 289 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
169
click to vote
SDM
2011
SIAM
14 years 7 months ago
2011
SIAM
Extracting semantic relations between entities is an important step towards automatic text understanding. In this paper, we propose a novel Semi-supervised Convolution Graph Kerne...
138
click to vote
SIGCOMM
1991
ACM
15 years 7 months ago
1991
ACM
We consider the problem of providing network access to hosts whose physical location changes with time. Such hosts cannot depend on traditional forms of network connectivity and r...
169
click to vote
IPPS
2010
IEEE
15 years 2 months ago
2010
IEEE
To exploit the potential of multicore architectures, recent dense linear algebra libraries have used tile algorithms, which consist in scheduling a Directed Acyclic Graph (DAG) of...
136
click to vote
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
— In this paper, we address the issues of compliant control of a robot under contact constraints with a goal of using joint space based pattern generators as movement primitives,...
144
click to vote
VTC
2007
IEEE
15 years 10 months ago
2007
IEEE
—To approximate the exact peaks of continuous-time orthogonal frequency division multiplexing (OFDM) signals, four times oversampling is usually employed for discrete-time OFDM s...