2517 search results - page 10 / 504 » Specifying Weak Sets |
DM
2008
13 years 7 months ago
2008
In [2], Duffus et al. showed that every connected graph G which contains no induced subgraph isomorphic to a claw or a net is traceable. And they also showed that if a 2-connected...
ICDM
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers...
ATAL
2011
Springer
12 years 7 months ago
2011
Springer
Recent work in communications and business modeling emphasizes a commitment-based view of interaction. By abstracting away from implementation-level details, commitments can poten...
JDCTA
2008
13 years 7 months ago
2008
A rule set generation technique based on a generated decision tree is suggested for better decision making to compensate the weak point of decision trees
IS
2006
13 years 7 months ago
2006
We propose a micro-benchmark for XML data management to aid engineers in designing improved XML processing engines. This benchmark is inherently different from application-level b...