Sciweavers

1301 search results - page 46 / 261
» Specifications via Realizability
Sort
View
EMNLP
2010
15 years 4 months ago
Automatic Keyphrase Extraction via Topic Decomposition
Existing graph-based ranking methods for keyphrase extraction compute a single importance score for each word via a single random walk. Motivated by the fact that both documents a...
Zhiyuan Liu, Wenyi Huang, Yabin Zheng, Maosong Sun
CAISE
2005
Springer
15 years 11 months ago
Event-Based Modeling of Evolution for Semantic-Driven Systems
Ontologies play a key role in the realization of the Semantic Web. An ontology is used as an explicit specification of a shared conceptualization of a given domain. When such a dom...
Peter Plessers, Olga De Troyer, Sven Casteleyn
CVPR
2009
IEEE
17 years 1 months ago
Continuous Ratio Optimization via Convex Relaxation with Applications to Multiview 3D Reconstruction
We introduce a convex relaxation framework to optimally minimize continuous surface ratios. The key idea is to minimize the continuous surface ratio by solving a sequence of con...
Kalin Kolev (University of Bonn), Daniel Cremers (...
ICCV
2001
IEEE
16 years 8 months ago
Computing Visual Correspondence with Occlusions via Graph Cuts
Several new algorithms for visual correspondence based on graph cuts [6, 13, 16] have recently been developed. While these methods give very strong results in practice, they do no...
Vladimir Kolmogorov, Ramin Zabih
SIGCSE
2009
ACM
135views Education» more  SIGCSE 2009»
16 years 6 months ago
Breadth-last technical electives: integrating the CS core via computer games and mobile robotics
In this paper, we introduce the concept of breadth-last technical elective courses, which are designed to assist undergraduate CS students in integrating their entire core curricu...
William W. White, Jerry B. Weinberg