Sciweavers

1722 search results - page 110 / 345
» On the sample mean of graphs
Sort
View
CSB
2003
IEEE
150views Bioinformatics» more  CSB 2003»
15 years 11 months ago
Algorithms for Bounded-Error Correlation of High Dimensional Data in Microarray Experiments
The problem of clustering continuous valued data has been well studied in literature. Its application to microarray analysis relies on such algorithms as -means, dimensionality re...
Mehmet Koyutürk, Ananth Grama, Wojciech Szpan...
DAGSTUHL
2007
15 years 7 months ago
An analytic solution to the alibi query in the bead model for moving object data
Abstract. Moving objects produce trajectories, which are stored in databases by means of finite samples of time-stamped locations. When also speed limitations in these sample poin...
Bart Kuijpers, Walied Othman
TMI
2010
112views more  TMI 2010»
15 years 4 months ago
Regularized Interpolation for Noisy Images
Abstract—Interpolation is the means by which a continuouslydefined model is fit to discrete data samples. When the data samples are exempt of noise, it seems desirable to build...
Sathish Ramani, Philippe Thévenaz, Michael ...
ACSD
2007
IEEE
109views Hardware» more  ACSD 2007»
15 years 10 months ago
Efficient Automatic Resolution of Encoding Conflicts Using STG Unfoldings
Synthesis of asynchronous circuits from Signal Transition Graphs (STGs) involves resolution of state encoding conflicts by means of refining the STG specification. In this paper, ...
Victor Khomenko
ISCIS
2004
Springer
15 years 11 months ago
Stubborn Sets for Priority Nets
Partial order methods, such as the stubborn set method and the priority method, reduce verification effort by exploiting irrelevant orders of events. We show how the stubborn set...
Kimmo Varpaaniemi