Sciweavers

380 search results - page 44 / 76
» Instance Matching with COMA
Sort
View
TREC
2008
13 years 9 months ago
University of Waterloo at TREC 2008 Blog Track
The paper reports the University of Waterloo participation in the opinion and polarity tasks of the Blog track. The proposed method uses a lexicon built from several linguistic re...
Olga Vechtomova
FLAIRS
2006
13 years 9 months ago
On Repairing Reasoning Reversals via Representational Refinements
Representation is a fluent. A mismatch between the real world and an agent's representation of it can be signalled by unexpected failures (or successes) of the agent's r...
Alan Bundy, Fiona McNeill, Christopher Walton
DLOG
2003
13 years 9 months ago
Extensions to Description Logics
This chapter considers, on the one hand, extensions of Description Logics by features not available in the basic framework, but considered important for using Description Logics a...
Franz Baader, Ralf Küsters, Frank Wolter
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
13 years 9 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan
CANDC
2000
ACM
13 years 7 months ago
Sequence Complexity for Biological Sequence Analysis
A new statistical model for DNA considers a sequence to be a mixture of regions with little structure and regions that are approximate repeats of other subsequences, i.e. instance...
Lloyd Allison, Linda Stern, Timothy Edgoose, Trevo...