3265 search results - page 319 / 653 » Representing Groups on Graphs |
194
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Geometric rearrangement of images includes operations
such as image retargeting, inpainting, or object rearrangement.
Each such operation can be characterized by a shiftmap:
the...
189
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
168
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
We consider spectral clustering and transductive inference for data with multiple views. A typical example is the web, which can be described by either the hyperlinks between web ...
175
click to vote
SIGSOFT
2008
ACM
2008
ACM
Experience in using a process language to define scientific workflow and generate dataset provenance
16 years 7 months ago
This paper describes our experiences in exploring the applicability of software engineering approaches to scientific data management problems. Specifically, this paper describes h...
174
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...