1376 search results - page 264 / 276 » Searching Trees: An Essay |
EDBT
2009
ACM
15 years 6 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
106
click to vote
TABLEAUX
2009
Springer
15 years 6 months ago
2009
Springer
We consider two sequent calculi for tense logic in which the syntactic judgements are nested sequents, i.e., a tree of traditional onesided sequents built from multisets of formula...
111
Voted
VTC
2008
IEEE
15 years 6 months ago
2008
IEEE
—When the maximum number of best candidates retained at each tree search level of the K-Best Sphere Detection (SD) is kept low for the sake of maintaining a low memory requiremen...
82
Voted
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— We target M-ary data sequence estimation over time-variant frequency selective fading channels subject to cochannel interference (CCI). A novel joint reduced state sequence est...