Sciweavers

3775 search results - page 179 / 755
» The Expression Problem Revisited
Sort
View
TCS
2008
15 years 3 months ago
Itemset frequency satisfiability: Complexity and axiomatization
Computing frequent itemsets is one of the most prominent problems in data mining. We study the following related problem, called FREQSAT, in depth: given some itemset-interval pai...
Toon Calders
ECAI
2010
Springer
15 years 2 months ago
Local search algorithms on the Stable Marriage Problem: Experimental Studies
The stable marriage problem (SM) has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more general...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
ENTCS
2010
75views more  ENTCS 2010»
15 years 3 months ago
A Lightweight Approach to Customizable Composition Operators for Java-like Classes
We propose a formal framework for extending a class-based language, equipped with a given class composition mechanism, to allow programmers to define their own derived composition...
Giovanni Lagorio, Marco Servetto, Elena Zucca
VLDB
1989
ACM
97views Database» more  VLDB 1989»
15 years 7 months ago
Finding Regular Simple Paths in Graph Databases
We consider the following problem: given a labelled directedgraphG anda regularexpressionR, find all pairs of nodesconnectedby a simplepathsuchthattheconcatenationof thelabelsalon...
Alberto O. Mendelzon, Peter T. Wood
DBA
2006
236views Database» more  DBA 2006»
15 years 5 months ago
Quantizing Time Series for Efficient Subsequence Matching
Indexing time series data is an interesting problem that has attracted much interest in the research community for the last decade. Traditional indexing methods organize the data ...
Inés Fernando Vega López, Bongki Moo...