Sciweavers

2009 search results - page 402 / 402
» Dense Interest Points
Sort
View

Publication
303views
12 years 4 months ago
Evolutionary synthesis of analog networks
he significant increase in the available computational power that took place in recent decades has been accompanied by a growing interest in the application of the evolutionary ap...
Claudio Mattiussi
EUROSYS
2006
ACM
14 years 3 months ago
Experiences in building and operating ePOST, a reliable peer-to-peer application
Peer-to-peer (p2p) technology can potentially be used to build highly reliable applications without a single point of failure. However, most of the existing applications, such as ...
Alan Mislove, Ansley Post, Andreas Haeberlen, Pete...
CORR
2007
Springer
126views Education» more  CORR 2007»
13 years 6 months ago
Dial a Ride from k-forest
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath ...
VTC
2010
IEEE
176views Communications» more  VTC 2010»
13 years 4 months ago
Exploiting Redundancy in Iterative H.264 Joint Source and Channel Decoding For Robust Video Transmission
— In this paper we propose joint optimisation of soft-bit assisted iterative joint source and channel decoding with the aid of our proposed EXIT chart optimised redundant source ...
Nasruminallah, Lajos Hanzo