Sciweavers

377 search results - page 36 / 76
» A Fast Heuristic Algorithm for a Probe Mapping Problem
Sort
View
ICML
2003
IEEE
14 years 9 months ago
Tackling the Poor Assumptions of Naive Bayes Text Classifiers
Naive Bayes is often used as a baseline in text classification because it is fast and easy to implement. Its severe assumptions make such efficiency possible but also adversely af...
Jason D. Rennie, Lawrence Shih, Jaime Teevan, Davi...
TIP
2010
111views more  TIP 2010»
13 years 3 months ago
Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation
Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we study a classical demosaicking algorithm based on alternating projections (AP), propos...
Yue M. Lu, Mina Karzand, Martin Vetterli
ESWS
2009
Springer
14 years 3 months ago
A Reasoning-Based Support Tool for Ontology Mapping Evaluation
In this paper we describe a web-based tool that supports the human in revising ontology alignments. Our tool uses logical reasoning as a basis for detecting conflicts in mappings ...
Christian Meilicke, Heiner Stuckenschmidt, Ondrej ...
JODS
2006
148views Data Mining» more  JODS 2006»
13 years 8 months ago
Discovering the Semantics of Relational Tables Through Mappings
Abstract. Many problems in Information and Data Management require a semantic account of a database schema. At its best, such an account consists of formulas expressing the relatio...
Yuan An, Alexander Borgida, John Mylopoulos
DSD
2004
IEEE
126views Hardware» more  DSD 2004»
14 years 12 days ago
Boolean Minimizer FC-Min: Coverage Finding Process
This paper describes principles of a novel two-level multi-output Boolean minimizer FC-Min, namely its Find Coverage phase. The problem of Boolean minimization is approached in a ...
Petr Fiser, Hana Kubatova