2799 search results - page 377 / 560 » computing 1998 |
157
click to vote
ICCV
1998
IEEE
15 years 9 months ago
1998
IEEE
We areinterestedin descriptionsof 3-D data sets,as obtained from stereoor a 3-D digitizer. We thereforeconsideras inputa sparsesetof points, possibly associated with certain orien...
124
click to vote
SIGGRAPH
1998
ACM
15 years 9 months ago
1998
ACM
We investigate the general problem of reproducing color images on an offset press using custom inks in any combination and number. While this problem has been explored previously ...
167
click to vote
RECOMB
1998
Springer
15 years 9 months ago
1998
Springer
Given a strong match between regions of two sequences, how far can the match be meaningfully extended if gaps are allowed in the resulting alignment? The aim is to avoid searching...
127
Voted
WSC
1998
15 years 6 months ago
1998
Informational Macrodynamics (IMD) presents a unified informational systemic approach with common information language for modeling, analysis and optimization of a variety of inter...
139
click to vote
TCS
1998
15 years 4 months ago
1998
![Threshold Dominating Sets and an Improved Characterization of W[2]](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/threshold_dominating_sets_and_an_improved_characterization_of_w_2_TCS_1998.jpg "Threshold Dominating Sets and an Improved Characterization of W[2]")
The Threshold Dominating Set problem is that of determining for a graph G = (V, E) whether there is a subset V ⊆ V of size k, such that for each vertex v ∈ V there are at leas...