Sciweavers

1396 search results - page 181 / 280
» Succinct Dynamic Data Structures
Sort
View
DAGSTUHL
2001
15 years 2 months ago
Visualizing Memory Graphs
To understand the dynamics of a running program, it is often useful to examine its state at specific moments during its execution. We present memory graphs as a means to capture an...
Thomas Zimmermann, Andreas Zeller
ISMB
1993
15 years 2 months ago
Discovering Sequence Similarity by the Algorithmic Significance Method
The minimal-length encoding approach is applied to define concept of sequence similarity. Asequence is defined to be similar to another sequence or to a set of keywords if it can ...
Aleksandar Milosavljevic
ICWS
2010
IEEE
14 years 12 months ago
jGASW: A Service-Oriented Framework Supporting HTC and Non-functional Concerns
—Although Service-Oriented principles have been widely adopted by High Throughput Computing infrastructure designers, the integration between SOA and HTC is made difficult by le...
Javier Rojas Balderrama, Johan Montagnat, Diane Li...
ICASSP
2011
IEEE
14 years 5 months ago
Acoustic-to-articulatory inversion using an episodic memory
This paper presents a new acoustic-to-articulatory inversion methodbased on an episodic memory, which is an interesting model for two reasons. First, it does not rely on any assum...
Sébastien Demange, Slim Ouni
CORR
2010
Springer
249views Education» more  CORR 2010»
15 years 1 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder