Sciweavers

4075 search results - page 484 / 815
» Modeling Distributed Algorithm Using B
Sort
View
IOPADS
1997
152views more  IOPADS 1997»
15 years 8 months ago
Competitive Parallel Disk Prefetching and Buffer Management
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
Rakesh D. Barve, Mahesh Kallahalla, Peter J. Varma...
148
Voted
ICPR
2002
IEEE
16 years 7 months ago
Fractional Component Analysis (FCA) for Mixed Signals
This paper proposes the fractional component analysis (FCA), whose goal is to decompose the observed signal into component signals and recover their fractions. The uniqueness of o...
Asanobu Kitamoto
ICPR
2010
IEEE
15 years 5 months ago
2LDA: Segmentation for Recognition
Abstract—Following the trend of “segmentation for recognition”, we present 2LDA, a novel generative model to automatically segment an image in 2 segments, background and fore...
Alessandro Perina, Marco Cristani, Vittorio Murino
SIGMETRICS
2010
ACM
197views Hardware» more  SIGMETRICS 2010»
15 years 11 months ago
Coloring spatial point processes with applications to peer discovery in large wireless networks
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
Jian Ni, R. Srikant, Xinzhou Wu
ISMIR
2005
Springer
154views Music» more  ISMIR 2005»
16 years 7 days ago
Exploiting the Tradeoff Between Precision and Cpu-Time to Speed Up Nearest Neighbor Search
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
Pierre Roy, Jean-Julien Aucouturier, Franço...