Sciweavers

4117 search results - page 125 / 824
» On the Satisfiability of Complex Constraints
Sort
View
VLDB
1999
ACM
188views Database» more  VLDB 1999»
15 years 10 months ago
SPIRIT: Sequential Pattern Mining with Regular Expression Constraints
Discovering sequential patterns is an important problem in data mining with a host of application domains including medicine, telecommunications, and the World Wide Web. Conventio...
Minos N. Garofalakis, Rajeev Rastogi, Kyuseok Shim
EDBT
2008
ACM
146views Database» more  EDBT 2008»
15 years 8 months ago
SPARQLing constraints for RDF
The goal of the Semantic Web is to support semantic interoperability between applications exchanging data on the web. The idea heavily relies on data being made available in machi...
Georg Lausen, Michael Meier 0002, Michael Schmidt
KDID
2003
93views Database» more  KDID 2003»
15 years 7 months ago
A Framework for Frequent Sequence Mining under Generalized Regular Expression Constraints
This paper provides a framework for the extraction of frequent sequences satisfying a given regular expression (RE) constraint. We take advantage of the information contained in th...
Hunor Albert-Lorincz, Jean-François Boulica...
CIKM
2010
Springer
15 years 5 months ago
Ranking under temporal constraints
This paper introduces the notion of temporally constrained ranked retrieval, which, given a query and a time constraint, produces the best possible ranked list within the specifi...
Lidan Wang, Donald Metzler, Jimmy Lin
HEURISTICS
2008
136views more  HEURISTICS 2008»
15 years 5 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet