Sciweavers

1813 search results - page 39 / 363
» Instance Pruning Techniques
Sort
View
CP
2006
Springer
15 years 3 months ago
Inner and Outer Approximations of Existentially Quantified Equality Constraints
We propose a branch and prune algorithm that is able to compute inner and outer approximations of the solution set of an existentially quantified constraint where existential param...
Alexandre Goldsztejn, Luc Jaulin
ISMB
2003
15 years 1 months ago
PSI: indexing protein structures for fast similarity search
We consider the problem of finding similarities in protein structure databases. Our techniques extract feature vectors on triplets of SSEs (Secondary Structure Elements). Later, ...
Orhan Çamoglu, Tamer Kahveci, Ambuj K. Sing...
DASFAA
2007
IEEE
151views Database» more  DASFAA 2007»
15 years 3 months ago
On Label Stream Partition for Efficient Holistic Twig Join
Label stream partition is a useful technique to reduce the input I/O cost of holistic twig join by pruning useless streams beforehand. The Prefix Path Stream (PPS) partition scheme...
Bo Chen, Tok Wang Ling, M. Tamer Özsu, Zhenzh...
EDBT
2009
ACM
138views Database» more  EDBT 2009»
15 years 6 months ago
FOGGER: an algorithm for graph generator discovery
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
Zhiping Zeng, Jianyong Wang, Jun Zhang, Lizhu Zhou
CSCLP
2005
Springer
15 years 5 months ago
A CSP Search Algorithm with Reduced Branching Factor
This paper presents an attempt to construct a ”practical” CSP algorithm that assigns a variable with 2 values at every step. Such a strategy has been successfully used for cons...
Igor Razgon, Amnon Meisels