Sciweavers

1176 search results - page 213 / 236
» Implicit Abstraction Heuristics
Sort
View
CVPR
2010
IEEE
14 years 12 months ago
A Study on Continuous Max-Flow and Min-Cut Approaches
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
Jing Yuan, Egil Bae, Xuecheng Tai
APLAS
2008
ACM
14 years 11 months ago
Exception Handlers as Extensible Cases
Abstract. Exceptions are an indispensable part of modern programming languages. They are, however, handled poorly, especially by higherorder languages such as Standard ML and Haske...
Matthias Blume, Umut A. Acar, Wonseok Chae
ASWC
2008
Springer
14 years 11 months ago
Scalable Distributed Ontology Reasoning Using DHT-Based Partitioning
Abstract. Ontology reasoning is an indispensable step to fully exploit the implicit semantics of Semantic Web data. The inherent distribution characteristic of the Semantic Web and...
Qiming Fang, Ying Zhao, Guangwen Yang, Weimin Zhen...
CIKM
2008
Springer
14 years 11 months ago
Intra-document structural frequency features for semi-supervised domain adaptation
In this work we try to bridge the gap often encountered by researchers who find themselves with few or no labeled examples from their desired target domain, yet still have access ...
Andrew Arnold, William W. Cohen
ESA
2008
Springer
108views Algorithms» more  ESA 2008»
14 years 11 months ago
Two-Stage Robust Network Design with Exponential Scenarios
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, ...