Sciweavers

PVLDB
2010
129views more  PVLDB 2010»
13 years 10 months ago
Graph Pattern Matching: From Intractable to Polynomial Time
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...
PVLDB
2010
96views more  PVLDB 2010»
13 years 10 months ago
Scalable Data Exchange with Functional Dependencies
The recent literature has provided a solid theoretical foundation for the use of schema mappings in data-exchange applications. Following this formalization, new algorithms have b...
Bruno Marnette, Giansalvatore Mecca, Paolo Papotti
PPSN
2010
Springer
13 years 10 months ago
Ant Colony Optimization with Immigrants Schemes in Dynamic Environments
Abstract. In recent years, there has been a growing interest in addressing dynamic optimization problems (DOPs) using evolutionary algorithms (EAs). Several approaches have been de...
Michalis Mavrovouniotis, Shengxiang Yang
PPSN
2010
Springer
13 years 10 months ago
Optimisation and Generalisation: Footprints in Instance Space
Abstract. The chief purpose of research in optimisation is to understand how to design (or choose) the most suitable algorithm for a given distribution of problem instances. Ideall...
David W. Corne, Alan P. Reynolds
PPDP
2010
Springer
13 years 10 months ago
Dimensions in program synthesis
Program Synthesis, which is the task of discovering programs that realize user intent, can be useful in several scenarios: enabling people with no programming background to develo...
Sumit Gulwani
PKDD
2010
Springer
183views Data Mining» more  PKDD 2010»
13 years 10 months ago
Fast Active Exploration for Link-Based Preference Learning Using Gaussian Processes
Abstract. In preference learning, the algorithm observes pairwise relative judgments (preference) between items as training data for learning an ordering of all items. This is an i...
Zhao Xu, Kristian Kersting, Thorsten Joachims
PAMI
2010
205views more  PAMI 2010»
13 years 10 months ago
Learning a Hierarchical Deformable Template for Rapid Deformable Object Parsing
In this paper, we address the tasks of detecting, segmenting, parsing, and matching deformable objects. We use a novel probabilistic object model that we call a hierarchical defor...
Long Zhu, Yuanhao Chen, Alan L. Yuille
PAMI
2010
222views more  PAMI 2010»
13 years 10 months ago
Fast Algorithm for Walsh Hadamard Transform on Sliding Windows
— This paper proposes a fast algorithm for Walsh Hadamard Transform on sliding windows which can be used to implement pattern matching most efficiently. The computational require...
Wanli Ouyang, Wai-kuen Cham
PAA
2010
13 years 10 months ago
A simple iterative algorithm for parsimonious binary kernel Fisher discrimination
By applying recent results in optimization theory variously known as optimization transfer or majorize/minimize algorithms, an algorithm for binary, kernel, Fisher discriminant ana...
Robert F. Harrison, Kitsuchart Pasupa
NA
2010
69views more  NA 2010»
13 years 10 months ago
Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
A method for linearly constrained optimization which modifies and generalizes recent box-constraint optimization algorithms is introduced. The new algorithm is based on a relaxed...
Marina Andretta, Ernesto G. Birgin, José Ma...