Sciweavers

380 search results - page 44 / 76
» A Categorical Setting for Lower Complexity
Sort
View
86
Voted
ISSRE
2010
IEEE
14 years 8 months ago
Characterizing Failures in Mobile OSes: A Case Study with Android and Symbian
Abstract—As smart phones grow in popularity, manufacturers are in a race to pack an increasingly rich set of features into these tiny devices. This brings additional complexity i...
Amiya Kumar Maji, Kangli Hao, Salmin Sultana, Saur...
75
Voted
ICIP
2002
IEEE
15 years 11 months ago
Packet loss protection of embedded data with fast local search
Unequal loss protection with systematic Reed-Solomon codes allows reliable transmission of embedded multimedia over packet erasure channels. The design of a fast algorithm with lo...
Vladimir Stankovic, Raouf Hamzaoui, Zixiang Xiong
ICTAI
2009
IEEE
15 years 4 months ago
A Multi-objective Genetic Algorithm for Community Detection in Networks
A multiobjective genetic algorithm to uncover community structure in complex network is proposed. The algorithm optimizes two objective functions able to identify densely connecte...
Clara Pizzuti
CVPR
2008
IEEE
15 years 4 months ago
Fast kernel learning for spatial pyramid matching
Spatial pyramid matching (SPM) is a simple yet effective approach to compute similarity between images. Similarity kernels at different regions and scales are usually fused by som...
Junfeng He, Shih-Fu Chang, Lexing Xie
WG
2005
Springer
15 years 3 months ago
Computation of Chromatic Polynomials Using Triangulations and Clique Trees
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
Pascal Berthomé, Sylvain Lebresne, Kim Nguy...