1697 search results - page 178 / 340 » On Bayesian Case Matching |
103
click to vote
ENDM
2007
15 years 3 months ago
2007
Given a set F of faulty edges or faulty vertices in the hypercube Qn and a pair of vertices u, v, is there a hamiltonian cycle or a hamiltonian path between u and v in Qn −F? We...
155
click to vote
NJC
2006
15 years 3 months ago
2006
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
144
click to vote
APN
2010
Springer
15 years 1 months ago
2010
Springer
Workflow mining is the task of automatically producing a workflow model from a set of event logs recording sequences of workflow events; each sequence corresponds to a use case or ...
114
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
This paper deals with the minimal polyadic decomposition (also known as canonical decomposition or Parafac) of a 3way array, assuming each entry is positive. In this case, the low...
198
click to vote
APPROX
2011
Springer
14 years 3 months ago
2011
Springer
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...