21324 search results - page 373 / 4265 » Making the case for computing |
137
Voted
GD
2006
Springer
15 years 8 months ago
2006
Springer
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if ...
138
click to vote
TCOM
2011
14 years 12 months ago
2011
— The computational complexity of optimum decoding for an orthogonal space-time block code is quantified. Four equivalent techniques of optimum decoding which have the same comp...
176
click to vote
CIKM
2007
Springer
15 years 11 months ago
2007
Springer
Regular path queries (RPQ’s) are given by means of regular expressions and ask for matching patterns on labeled graphs. RPQ’s have received great attention in the context of s...
142
click to vote
ICRA
2006
IEEE
15 years 11 months ago
2006
IEEE
— This paper presents an interior point approach to exact distance computation between convex objects represented as intersections of implicit surfaces. Exact distance computatio...
189
click to vote
ICS
1992
Tsinghua U.
15 years 9 months ago
1992
Tsinghua U.
CODE 2.0 is a graphical parallel programming system that targets the three goals of ease of use, portability, and production of efficient parallel code. Ease of use is provided by...