#### Filter Results:

- Full text PDF available (24)

#### Publication Year

1995

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Angèle M. Hamel, Ian P. Goulden
- Eur. J. Comb.
- 1995

- Michael H. Albert, Alexander Golynski, Angèle M. Hamel, Alejandro López-Ortiz, S. Srinivasa Rao, Mohammad Ali Safari
- Theor. Comput. Sci.
- 2004

We consider the problem of ÿnding the longest increasing subsequence in a sliding window over a given sequence (LISW). We propose an output-sensitive data structure that solves this problem in time O(n log log n + OUTPUT) for a sequence of n elements. This data structure substantially improves over the na ve generalization of the longest increasing… (More)

A recent paper (Edman et al. [6]) has taken a combinatorial approach to measuring the anonymity of a threshold mix anonymous communications system. Their paper looks at ways of matching individual messages sent to individual messages received, irrespective of user, and determines a measure of the anonymity provided by the system. Here we extend this… (More)

- Ziv Bar-Joseph, Erik D. Demaine, David K. Gifford, Nathan Srebro, Angèle M. Hamel, Tommi S. Jaakkola
- Bioinformatics
- 2002

MOTIVATION
A major challenge in gene expression analysis is effective data organization and visualization. One of the most popular tools for this task is hierarchical clustering. Hierarchical clustering allows a user to view relationships in scales ranging from single genes to large sets of genes, while at the same time providing a global view of the… (More)

- A M Hamel
- 2008

Alternating sign matrices with a U–turn boundary (UASMs) are a recent generalization of ordinary alternating sign matrices. Here we show that variations of these matrices are in bijective correspondence with certain symplectic shifted tableaux that were recently introduced in the context of a symplectic version of Tokuyama's deformation of Weyl's… (More)

- Ziv Bar-Joseph, Therese Biedl, +6 authors Tomáš Vinař
- 2001

In this paper, we study how to present gene expression data to display similarities by trying to find a linear ordering of genes such that genes with similar expression profiles will be close in this ordering. In general, finding the best possible order is intractable, and furthermore an unrestricted ordering may not be desired. Therefore we concentrate on… (More)

- A M Hamel, A. M. Hamel
- 2008

We give a bijective proof of an identity relating primed shifted gl(n)-standard tableaux to the product of a gl(n) character in the form of a Schur function and 1≤i<j≤n (x i + y j). This result generalises a number of well–known results due to Robbins and Rumsey, Chapman, Tokuyama, Okada and Macdonald. An analogous result is then obtained in the case of… (More)

- Therese C. Biedl, Brona Brejová, Erik D. Demaine, Angèle M. Hamel, Alejandro López-Ortiz, Tomás Vinar
- Theor. Comput. Sci.
- 2003

Consider a game in a given set of intervals (and their implied interval graph G) in which the adversary chooses an independent set X in G. The goal is to discover this hidden independent set X by making the fewest queries of the form " Is point p covered by an interval in X? " Our interest in this problem stems from two applications: experimental gene… (More)

Measuring path compromise in the anonymity system Tor is a problem of important and immediate interest. We discuss the drawbacks to the traditional anonymity network measure—entropy—and explore the advantages of an attack-based measure. Our perspective is that of an adversary with a bandwidth budget (a fixed amount of bandwidth he or she can compromise),… (More)

- Angèle M. Hamel
- J. Comb. Theory, Ser. A
- 2001