Sciweavers

1093 search results - page 22 / 219
» Fast Abstracts
Sort
View
ACIVS
2009
Springer
13 years 5 months ago
Enhanced Low-Resolution Pruning for Fast Full-Search Template Matching
Abstract. Gharavi-Alkhansari [1] proposed a full-search equivalent algorithm for speeding-up template matching based on Lp-norm distance measures. This algorithm performs a pruning...
Stefano Mattoccia, Federico Tombari, Luigi di Stef...
INFOCOM
2009
IEEE
14 years 2 months ago
Fast Algorithms and Performance Bounds for Sum Rate Maximization in Wireless Networks
Abstract— Sum rate maximization by power control is an important, challenging, and extensively studied problem in wireless networks. It is a nonconvex optimization problem and ac...
Chee-Wei Tan, Mung Chiang, R. Srikant
ESA
2009
Springer
106views Algorithms» more  ESA 2009»
14 years 2 months ago
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
Abstract. We consider the multivariate interlace polynomial introduced by Courcelle (2008), which generalizes several interlace polynomials defined by Arratia, Bollob´as, and Sor...
Markus Bläser, Christian Hoffmann
HASKELL
2009
ACM
14 years 2 months ago
Alloy: fast generic transformations for Haskell
Data-type generic programming can be used to traverse and manipulate specific parts of large heterogeneously-typed tree structures, without the need for tedious boilerplate. Gene...
Neil C. C. Brown, Adam T. Sampson
INFOCOM
2008
IEEE
14 years 2 months ago
A Backup Route Aware Routing Protocol - Fast Recovery from Transient Routing Failures
Abstract— As the Internet becomes the critical information infrastructure for both personal and business applications, survivable routing protocols need to be designed that maint...
Feng Wang, Lixin Gao