1093 search results - page 208 / 219 » Clustering from Constraint Graphs |
125
click to vote
CAV
2010
Springer
15 years 5 months ago
2010
Springer
ions of ODE models (MAPLE, GNA). On the algorithmic side (Sec. 3.2), it supports two main streams in high-performance model checking: reachability analysis based on BDDs (symbolic)...
141
click to vote
JCB
2007
15 years 1 months ago
2007
Many bioinformatics problems can implicitly depend on estimating large-scale covariance matrix. The traditional approaches tend to give rise to high variance and low accuracy esti...
102
click to vote
ESA
2009
Springer
15 years 8 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
130
click to vote
ICDM
2006
IEEE
15 years 8 months ago
2006
IEEE
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
130
click to vote
NETWORK
2007
15 years 1 months ago
2007
If we abstract a sensor network as a network graph consisting of vertices and edges, where vertices represent sensor nodes and edges represent distance measurements between neighbo...