Sciweavers

2695 search results - page 508 / 539
» Learning Graph Matching
Sort
View
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 2 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...

Publication
207views
16 years 5 days ago
Incorporating Higher-Order Cues in Image Colorization
We consider the colorization problem of grayscale images when some pixels, called scribbles, with initial colors are given. In this paper, we propose a new multi-layer graph model ...
Tae Hoon Kim (Seoul National University), Kyoung M...
112
Voted
IUI
2009
ACM
15 years 8 months ago
Discovering frequent work procedures from resource connections
Intelligent desktop assistants could provide more help for users if they could learn models of the users’ workflows. However, discovering desktop workflows is difficult becau...
Jianqiang Shen, Erin Fitzhenry, Thomas G. Dietteri...
CSE
2009
IEEE
15 years 8 months ago
First Steps to Netviz Nirvana: Evaluating Social Network Analysis with NodeXL
—Social Network Analysis (SNA) has evolved as a popular, standard method for modeling meaningful, often hidden structural relationships in communities. Existing SNA tools often i...
Elizabeth M. Bonsignore, Cody Dunne, Dana Rotman, ...
124
Voted
SIGGRAPH
2009
ACM
15 years 8 months ago
Spectral mesh processing
Spectral methods for mesh processing and analysis rely on the eigenvalues, eigenvectors, or eigenspace projections derived from appropriately defined mesh operators to carry out ...
Bruno Lévy, Hao Zhang 0002