Sciweavers

4536 search results - page 344 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Audio Signal Representations for Factorization in the Sparse Domain
In this paper, a new class of audio representations is introduced, together with a corresponding fast decomposition algorithm. The main feature of these representations is that th...
Manuel Moussallam, Laurent Daudet, Gaël Richa...
INFOCOM
2012
IEEE
13 years 9 months ago
A simpler and better design of error estimating coding
—We study error estimating codes with the goal of establishing better bounds for the theoretical and empirical overhead of such schemes. We explore the idea of using sketch data ...
Nan Hua, Ashwin Lall, Baochun Li, Jun Xu
EUSFLAT
2009
175views Fuzzy Logic» more  EUSFLAT 2009»
15 years 4 months ago
Ant Colony Optimization for Distributed Routing Path Optimization in Optical Burst-Switched Networks
This work describes a distributed framework for routing path optimization in Optical Burst-Switched (OBS) networks that loosely mimics the foraging behaviour of ants observed in na...
João Pedro, João Pires, João ...
SIGCSE
2000
ACM
169views Education» more  SIGCSE 2000»
15 years 11 months ago
Design patterns for lazy evaluation
We propose an object-oriented (OO) formulation and implementation of lazy/delayed evaluation by reusing and extending an existing linear recursive structure (LRS) framework with t...
Dung Zung Nguyen, Stephen B. Wong
PKDD
2010
Springer
158views Data Mining» more  PKDD 2010»
15 years 5 months ago
Learning Sparse Gaussian Markov Networks Using a Greedy Coordinate Ascent Approach
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...
Katya Scheinberg, Irina Rish