Sciweavers

14548 search results - page 2722 / 2910
» The Optimal Path-Matching Problem
Sort
View
IPCO
2008
118views Optimization» more  IPCO 2008»
15 years 7 months ago
Constraint Orbital Branching
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
LREC
2008
108views Education» more  LREC 2008»
15 years 7 months ago
Spatiotemporal Annotation Using MiniSTEx: how to deal with Alternative, Foreign, Vague and/or Obsolete Names?
We are currently developing MiniSTEx, a spatiotemporal annotation system to handle temporal and/or geospatial information directly and indirectly expressed in texts. In the end, t...
Ineke Schuurman
LREC
2008
84views Education» more  LREC 2008»
15 years 7 months ago
A Test Suite for Inference Involving Adjectives
Recently, most of the research in NLP has concentrated on the creation of applications coping with textual entailment. However, there still exist very few resources for the evalua...
Marilisa Amoia, Claire Gardent
LREC
2008
88views Education» more  LREC 2008»
15 years 7 months ago
An Infrastructure, Tools and Methodology for Evaluation of Multicultural Name Matching Systems
This paper describes a Name Matching Evaluation Laboratory that is a joint effort across multiple projects. The lab houses our evaluation infrastructure as well as multiple name m...
Keith J. Miller, Mark Arehart, Catherine Ball, Joh...
IJCAI
2007
15 years 7 months ago
Fast Image Alignment Using Anytime Algorithms
Image alignment refers to finding the best transformation from a fixed reference image to a new image of a scene. This process is often guided by similarity measures between ima...
Rupert Brooks, Tal Arbel, Doina Precup
« Prev « First page 2722 / 2910 Last » Next »