Sciweavers

1998 search results - page 243 / 400
» Complexity of the Cover Polynomial
Sort
View
VLDB
2005
ACM
114views Database» more  VLDB 2005»
15 years 6 months ago
Checking for k-Anonymity Violation by Views
When a private relational table is published using views, secrecy or privacy may be violated. This paper uses a formally-defined notion of k-anonymity to measure disclosure by vi...
Chao Yao, Xiaoyang Sean Wang, Sushil Jajodia
96
Voted
WABI
2005
Springer
109views Bioinformatics» more  WABI 2005»
15 years 6 months ago
Optimal Protein Threading by Cost-Splitting
Abstract. In this paper, we use integer programming approach for solving a hard combinatorial optimization problem, namely protein threading. For this sequence-to-structure alignme...
Philippe Veber, Nicola Yanev, Rumen Andonov, Vince...
130
Voted
COMPGEOM
2004
ACM
15 years 6 months ago
Computing persistent homology
We show that the persistent homology of a filtered ddimensional simplicial complex is simply the standard homology of a particular graded module over a polynomial ring. Our analy...
Afra Zomorodian, Gunnar Carlsson
119
Voted
ICML
2004
IEEE
15 years 6 months ago
Kernel-based discriminative learning algorithms for labeling sequences, trees, and graphs
We introduce a new perceptron-based discriminative learning algorithm for labeling structured data such as sequences, trees, and graphs. Since it is fully kernelized and uses poin...
Hisashi Kashima, Yuta Tsuboi
104
Voted
CIS
2004
Springer
15 years 6 months ago
Algorithms for Loosely Constrained Multiple Sequence Alignment
For finding accurate and biologically meaningful multiple sequence alignment, it is required to consider a loosely constrained version of multiple sequence alignment. This paper is...
Bin Song, Fengfeng Zhou, Guoliang Chen