Sciweavers

1274 search results - page 255 / 255
» Graph lambda theories
Sort
View
TVCG
2011
136views more  TVCG 2011»
13 years 26 days ago
Interactive Mesh Cutting Using Constrained Random Walks
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
Juyong Zhang, Jianmin Zheng, Jianfei Cai
CVIU
2011
12 years 9 months ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...
JCDL
2011
ACM
272views Education» more  JCDL 2011»
12 years 9 months ago
CollabSeer: a search engine for collaboration discovery
Collaborative research has been increasingly popular and important in academic circles. However, there is no open platform available for scholars or scientists to effectively dis...
Hung-Hsuan Chen, Liang Gou, Xiaolong Zhang, Clyde ...
DIMACS
1996
13 years 7 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin