848 search results - page 84 / 170 » Randomness and the linear degrees of computability |
171
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...
152
click to vote
CPM
1998
Springer
15 years 10 months ago
1998
Springer
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
161
click to vote
ACIVS
2005
Springer
15 years 11 months ago
2005
Springer
We describe a method for removing quantization artifacts (de-quantizing) in the image domain, by enforcing a high degree of sparseness in its representation with an overcomplete or...
145
click to vote
PG
2000
IEEE
15 years 10 months ago
2000
IEEE
The representation of moving geometry entities is an important issue in the fields of CAD/CAM and robotics motion design. We present a method to interpolate the moving frame homog...
146
click to vote
CGI
2004
IEEE
15 years 9 months ago
2004
IEEE
This paper presents a novel calibration method for datagloves with many degrees of freedom 1 . The goal of our method is to establish a mapping from the sensor values of the glove...