1093 search results - page 111 / 219 » Clustering from Constraint Graphs |
120
Voted
BMCBI
2006
15 years 3 months ago
2006
Background: With the advent of high-throughput proteomic experiments such as arrays of purified proteins comes the need to analyse sets of proteins as an ensemble, as opposed to t...
169
Voted
SDM
2012
SIAM
13 years 6 months ago
2012
SIAM
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 ...
153
Voted
AIPS
2010
15 years 4 months ago
2010
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
121
Voted
ASAP
1997
IEEE
15 years 7 months ago
1997
IEEE
This paper presents how to find optimized buffer size for VLSI architectures of full-search block matching algorithms. Starting from the DG (dependency graph) analysis, we focus i...
150
Voted
PATAT
2000
Springer
15 years 7 months ago
2000
Springer
Abstract The Examination Timetabling problem regards the scheduling for the exams of a set of university courses, avoiding the overlapping of exams having students in common, fairl...