5606 search results - page 753 / 1122 » Randomization Techniques for Graphs. |
203
click to vote
PAMI
2008
15 years 6 months ago
2008
Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity meas...
175
click to vote
TCS
2008
15 years 6 months ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
166
click to vote
TKDE
2008
15 years 6 months ago
2008
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
180
click to vote
TOG
2008
15 years 6 months ago
2008
Example-based texture synthesis algorithms have gained widespread popularity for their ability to take a single input image and create a perceptually similar non-periodic texture....
156
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We consider linear systems arising from the use of the finite element method for solving a certain class of linear elliptic problems. Our main result is that these linear systems, ...