1830 search results - page 70 / 366 » Workshop on Graph Computation Models |
148
click to vote
PAMI
2007
15 years 3 months ago
2007
—A novel patch-based correspondence model is presented in this paper. Many segment-based correspondence approaches have been proposed in recent years. Untextured pixels and bound...
190
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing ...
105
click to vote
CHI
2004
ACM
16 years 4 months ago
2004
ACM
The general aim of the workshop is to explore the temporal aspects of work for Human-Computer Interaction (HCI). This position paper attempts to contribute to the exploration by p...
126
click to vote
CHI
2006
ACM
16 years 4 months ago
2006
ACM
Non-traditional environments often change rapidly without forewarning, are difficult or impossible to control, and have other environmental and operational constraints that cannot...
142
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...