Sciweavers

6833 search results - page 123 / 1367
» Some two-character sets
Sort
View
SIAMDM
2010
105views more  SIAMDM 2010»
14 years 11 months ago
Minimal Inequalities for an Infinite Relaxation of Integer Programs
We show that maximal S-free convex sets are polyhedra when S is the set of integral points in some rational polyhedron of Rn . This result extends a theorem of Lov
Amitabh Basu, Michele Conforti, Gérard Corn...
WAOA
2010
Springer
232views Algorithms» more  WAOA 2010»
15 years 2 months ago
Approximation Algorithms for Domination Search
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
ACL
2009
15 years 2 months ago
The Lie Detector: Explorations in the Automatic Recognition of Deceptive Language
In this paper, we present initial experiments in the recognition of deceptive language. We introduce three data sets of true and lying texts collected for this purpose, and we sho...
Rada Mihalcea, Carlo Strapparava
CORR
2009
Springer
109views Education» more  CORR 2009»
15 years 1 months ago
Extensional and Intensional Strategies
on of abstract strategies which is extensional in the sense that a strategy is defined explicitly of derivations of an abstract reduction system. We then move to a more intensional...
Tony Bourdier, Horatiu Cirstea, Daniel J. Doughert...
143
Voted
ICTIR
2009
Springer
15 years 1 months ago
An Analysis of NP-Completeness in Novelty and Diversity Ranking
Abstract. A useful ability for search engines is to be able to rank objects with novelty and diversity: the top k documents retrieved should cover possible interpretations of a que...
Ben Carterette