Sciweavers

1887 search results - page 252 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
VLDB
2007
ACM
116views Database» more  VLDB 2007»
14 years 3 months ago
K-Anonymization as Spatial Indexing: Toward Scalable and Incremental Anonymization
In this paper we observe that k-anonymizing a data set is strikingly similar to building a spatial index over the data set, so similar in fact that classical spatial indexing tech...
Tochukwu Iwuchukwu, Jeffrey F. Naughton
NETWORKS
2011
12 years 12 months ago
On terminal delta-wye reducibility of planar graphs
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
Isidoro Gitler, Feliu Sagols
NIPS
2008
13 years 10 months ago
Hierarchical Semi-Markov Conditional Random Fields for Recursive Sequential Data
Inspired by the hierarchical hidden Markov models (HHMM), we present the hierarchical semi-Markov conditional random field (HSCRF), a generalisation of embedded undirected Markov ...
Tran The Truyen, Dinh Q. Phung, Hung Hai Bui, Svet...
BMCBI
2005
122views more  BMCBI 2005»
13 years 9 months ago
Bayesian coestimation of phylogeny and sequence alignment
Background: Two central problems in computational biology are the determination of the alignment and phylogeny of a set of biological sequences. The traditional approach to this p...
Gerton Lunter, István Miklós, Alexei...
IJCAI
2003
13 years 10 months ago
Optimal Time-Space Tradeoff in Probabilistic Inference
Recursive Conditioning, RC, is an any-space algorithm lor exact inference in Bayesian networks, which can trade space for time in increments of the size of a floating point number...
David Allen, Adnan Darwiche