Sciweavers

1697 search results - page 178 / 340
» On Bayesian Case Matching
Sort
View
ENDM
2007
70views more  ENDM 2007»
15 years 2 months ago
Hamiltonian fault-tolerance of hypercubes
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...
Tomás Dvorák, Petr Gregor
151
Voted
NJC
2006
102views more  NJC 2006»
15 years 2 months ago
Online Evaluation of Regular Tree Queries
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 ...
Alexandru Berlea
141
Voted
APN
2010
Springer
15 years 20 days ago
Learning Workflow Petri Nets
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 ...
Javier Esparza, Martin Leucker, Maximilian Schlund
110
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Nonnegative 3-way tensor factorization via conjugate gradient with globally optimal stepsize
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...
Jean-Philip Royer, Pierre Comon, Nadège Thi...
187
Voted
APPROX
2011
Springer
284views Algorithms» more  APPROX 2011»
14 years 2 months ago
On Approximating the Number of Relevant Variables in a Function
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...
Dana Ron, Gilad Tsur