613 search results - page 93 / 123 » Finding and Fixing Faults |
EJC
2006
14 years 11 months ago
2006
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
101
click to vote
IS
2008
14 years 11 months ago
2008
Discovering patterns with highly significance is an important problem in data mining discipline. An episode is defined to be a partially ordered set of events for a consecutive an...
IJWIN
2006
14 years 11 months ago
2006
We describe a trust-based data management framework enabling mobile devices to access the distributed computation, storage, and sensory resources available in pervasive computing ...
JUCS
2008
14 years 11 months ago
2008
: A chain or n-link is a sequence of n links whose lengths are fixed and are joined together from their endpoints, free to turn about their endpoints, which act as joints. "Ru...
101
click to vote
JMLR
2006
14 years 11 months ago
2006
Sparsity or parsimony of statistical models is crucial for their proper interpretations, as in sciences and social sciences. Model selection is a commonly used method to find such...