PVLDB
2010
13 years 8 months ago
2010
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...
PVLDB
2010
13 years 8 months ago
2010
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...
PPSN
2010
Springer
13 years 8 months ago
2010
Springer
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...
PPSN
2010
Springer
13 years 8 months ago
2010
Springer
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...
PPDP
2010
Springer
13 years 8 months ago
2010
Springer
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...
PKDD
2010
Springer
13 years 8 months ago
2010
Springer
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...
PAMI
2010
13 years 8 months ago
2010
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...
PAMI
2010
13 years 8 months ago
2010
— 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...
PAA
2010
13 years 8 months ago
2010
By applying recent results in optimization theory variously known as optimization transfer or majorize/minimize algorithms, an algorithm for binary, kernel, Fisher discriminant ana...
NA
2010
13 years 8 months ago
2010
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...