Sciweavers

212 search results - page 30 / 43
» Electoral search using the VerkiezingsKijker: an experience ...
Sort
View
IJCAI
2003
14 years 11 months ago
On a generalization of triangulated graphs for domains decomposition of CSPs
In [Jegou, 1993], a decomposition method has been introduced for improving search efficiency in the area of Constraint Satisfaction Problems. This method is based on properties of...
Assef Chmeiss, Philippe Jégou, Lamia Keddar
77
Voted
NETWORKS
2010
14 years 8 months ago
A branch-and-cut algorithm for partition coloring
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...
ERCIMDL
2007
Springer
119views Education» more  ERCIMDL 2007»
15 years 3 months ago
Exploring Digital Libraries with Document Image Retrieval
In this paper, we describe a system to perform Document Image Retrieval in Digital Libraries. The system allows users to retrieve digitized pages on the basis of layout similaritie...
Simone Marinai, Emanuele Marino, Giovanni Soda
ICIP
2005
IEEE
15 years 3 months ago
Robust face alignment based on local texture classifiers
We propose a robust face alignment algorithm with a novel discriminative local texture model. Different from the conventional descriptive PCA local texture model in ASM, classifie...
Li Zhang, Haizhou Ai, Shengjun Xin, Chang Huang, S...
64
Voted
IJCNLP
2005
Springer
15 years 3 months ago
Aligning Needles in a Haystack: Paraphrase Acquisition Across the Web
This paper presents a lightweight method for unsupervised extraction of paraphrases from arbitrary textual Web documents. The method differs from previous approaches to paraphrase...
Marius Pasca, Péter Dienes