Sciweavers

1738 search results - page 73 / 348
» An algorithmic framework for network reconstruction
Sort
View
ICIP
2009
IEEE
15 years 1 months ago
Randomness-in-Structured Ensembles for compressed sensing of images
Leading compressed sensing (CS) methods require m = O (k log(n)) compressive samples to perfectly reconstruct a k-sparse signal x of size n using random projection matrices (e.g., ...
Abdolreza A. Moghadam, Hayder Radha
149
Voted
3DPVT
2004
IEEE
136views Visualization» more  3DPVT 2004»
15 years 7 months ago
A Unified Representation for Interactive 3D Modeling
Interactive 3D modeling is the process of building a 3D model of an object or a scene in real-time while the 3D (range) data is acquired. This is possible only if the computationa...
Dragan Tubic, Patrick Hébert, Jean-Daniel D...
COMSUR
2011
219views Hardware» more  COMSUR 2011»
14 years 3 months ago
Link Scheduling Algorithms for Wireless Mesh Networks
Abstract—We provide an overview of link scheduling algorithms in Spatial Time Division Access (STDMA) wireless mesh networks. These algorithms can be classified into three categ...
Ashutosh Deepak Gore, Abhay Karandikar
GECCO
2009
Springer
152views Optimization» more  GECCO 2009»
15 years 10 months ago
Application of evolutionary algorithms in detection of SIP based flooding attacks
The Session Initiation Protocol (SIP) is the de facto standard for user’s session control in the next generation Voice over Internet Protocol (VoIP) networks based on the IP Mul...
M. Ali Akbar, Muddassar Farooq
ENTCS
2007
110views more  ENTCS 2007»
15 years 4 months ago
Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks
In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on this problem spans over more than three decades, in the last couple of years many ...
Camil Demetrescu, Giuseppe F. Italiano