Sciweavers

16 search results - page 1 / 4
» Efficient generation of all regular non-dominated coteries
Sort
View
PODC
2000
ACM
13 years 10 months ago
Efficient generation of all regular non-dominated coteries
A coterie is a family of subsets such that every pair of subsets in it has at least one element in common but neither is a subset of the other. We introduce an operator , which
Kazuhisa Makino, Tiko Kameda
APIN
2000
103views more  APIN 2000»
13 years 6 months ago
Probabilistic Pattern Matching and the Evolution of Stochastic Regular Expressions
The use of genetic programming for probabilistic pattern matching is investigated. A stochastic regular expression language is used. The language features a statistically sound sem...
Brian J. Ross
ICML
2007
IEEE
14 years 7 months ago
Entire regularization paths for graph data
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda
EDBT
2009
ACM
170views Database» more  EDBT 2009»
13 years 10 months ago
Efficient constraint evaluation in categorical sequential pattern mining for trajectory databases
The classic Generalized Sequential Patterns (GSP) algorithm returns all frequent sequences present in a database. However, usually a few ones are interesting from a user's po...
Leticia I. Gómez, Alejandro A. Vaisman
DSN
2008
IEEE
13 years 8 months ago
Convicting exploitable software vulnerabilities: An efficient input provenance based approach
Software vulnerabilities are the root cause of a wide range of attacks. Existing vulnerability scanning tools are able to produce a set of suspects. However, they often suffer fro...
Zhiqiang Lin, Xiangyu Zhang, Dongyan Xu