Sciweavers

569 search results - page 80 / 114
» High Performance Reasoning with Very Large Knowledge Bases
Sort
View
NIPS
2001
14 years 11 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio
BIS
2009
168views Business» more  BIS 2009»
14 years 10 months ago
Defining Adaptation Constraints for Business Process Variants
Abstract. In current dynamic business environment, it has been argued that certain characteristics of ad-hocism in business processes are desirable. Such business processes typical...
Ruopeng Lu, Shazia Wasim Sadiq, Guido Governatori,...
BMCBI
2010
161views more  BMCBI 2010»
14 years 7 months ago
LTC: a novel algorithm to improve the efficiency of contig assembly for physical mapping in complex genomes
Background: Physical maps are the substrate of genome sequencing and map-based cloning and their construction relies on the accurate assembly of BAC clones into large contigs that...
Zeev Frenkel, Etienne Paux, David I. Mester, Cathe...
BMCBI
2010
172views more  BMCBI 2010»
14 years 9 months ago
Comparison of evolutionary algorithms in gene regulatory network model inference
Background: The evolution of high throughput technologies that measure gene expression levels has created a data base for inferring GRNs (a process also known as reverse engineeri...
Alina Sîrbu, Heather J. Ruskin, Martin Crane
SDM
2012
SIAM
297views Data Mining» more  SDM 2012»
13 years 2 days ago
A Flexible Open-Source Toolbox for Scalable Complex Graph Analysis
The Knowledge Discovery Toolbox (KDT) enables domain experts to perform complex analyses of huge datasets on supercomputers using a high-level language without grappling with the ...
Adam Lugowski, David M. Alber, Aydin Buluç,...