Sciweavers

197 search results - page 30 / 40
» Association Analysis Techniques for Bioinformatics Problems
Sort
View
ISCI
2008
116views more  ISCI 2008»
13 years 8 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu
FUIN
2010
102views more  FUIN 2010»
13 years 6 months ago
Efficient Plan Adaptation through Replanning Windows and Heuristic Goals
Fast plan adaptation is important in many AI-applications. From a theoretical point of view, in the worst case adapting an existing plan to solve a new problem is no more efficien...
Alfonso Gerevini, Ivan Serina
JSCIC
2010
101views more  JSCIC 2010»
13 years 3 months ago
Boundary-Conforming Discontinuous Galerkin Methods via Extensions from Subdomains
A new way of devising numerical methods is introduced whose distinctive feature is the computation of a finite element approximation only in a polyhedral subdomain D of the origina...
Bernardo Cockburn, Deepa Gupta, Fernando Reitich
BMCBI
2008
121views more  BMCBI 2008»
13 years 9 months ago
Modularization of biochemical networks based on classification of Petri net t-invariants
Background: Structural analysis of biochemical networks is a growing field in bioinformatics and systems biology. The availability of an increasing amount of biological data from ...
Eva Grafahrend-Belau, Falk Schreiber, Monika Heine...
ICCV
2009
IEEE
1556views Computer Vision» more  ICCV 2009»
15 years 1 months ago
Kernel Methods for Weakly Supervised Mean Shift Clustering
Mean shift clustering is a powerful unsupervised data analysis technique which does not require prior knowledge of the number of clusters, and does not constrain the shape of th...
Oncel Tuzel, Fatih Porikli, Peter Meer