Sciweavers

511 search results - page 8 / 103
» More Precise Partition Abstractions
Sort
View
IJCNLP
2004
Springer
14 years 4 months ago
Bilingual Chunk Alignment Based on Interactional Matching and Probabilistic Latent Semantic Indexing
Abstract. An integrated method for bilingual chunk partition and alignment, called “Interactional Matching”, is proposed in this paper. Different from former works, our method...
Feifan Liu, Qianli Jin, Jun Zhao, Bo Xu
ACCV
2010
Springer
13 years 6 months ago
Spatiotemporal Contour Grouping Using Abstract Part Models
Part Models Pablo Sala1 , Diego Macrini2 , and Sven Dickinson1 1 University of Toronto, 2 Queen's University Abstract. In recent work [1], we introduced a framework for modelr...
Pablo Sala, Diego Macrini, Sven J. Dickinson
CONSTRAINTS
2008
132views more  CONSTRAINTS 2008»
13 years 11 months ago
Essence : A constraint language for specifying combinatorial problems
Abstract. Essence is a formal language for specifying combinatorial problems, in a manner similar to natural rigorous specifications that use a mixture of natural language and disc...
Alan M. Frisch, Warwick Harvey, Christopher Jeffer...
CPC
2007
113views more  CPC 2007»
13 years 11 months ago
Regular Partitions of Hypergraphs: Regularity Lemmas
Abstract. Szemer´edi’s regularity lemma for graphs has proved to be a powerful tool with many subsequent applications. The objective of this paper is to extend the techniques de...
Vojtech Rödl, Mathias Schacht
ICTAI
2009
IEEE
14 years 5 months ago
Local Autarkies Searching for the Dynamic Partition of CNF Formulae
In this paper an original dynamic partition of formulae in Conjunctive Normal Form (CNF) is presented. It is based on the autarky concept first introduced by Monien and Speckenme...
Éric Grégoire, Bertrand Mazure, Lakh...