Sciweavers

9842 search results - page 322 / 1969
» Problem complexity
Sort
View
ESORICS
2010
Springer
15 years 8 months ago
On Bounding Problems of Quantitative Information Flow
Abstract. Researchers have proposed formal definitions of quantitative information flow based on information theoretic notions such as the Shannon entropy, the min entropy, the gue...
Hirotoshi Yasuoka, Tachio Terauchi
IPM
2002
102views more  IPM 2002»
15 years 6 months ago
Problems of music information retrieval in the real world
Although a substantial number of research projects have addressed music information retrieval over the past three decades, the field is still very immature. Few of these projects ...
Donald Byrd, Tim Crawford
STACS
2010
Springer
16 years 1 months ago
An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
François Le Gall
ICRA
2008
IEEE
125views Robotics» more  ICRA 2008»
16 years 1 months ago
An approximation algorithm for the least overlapping p-Frame problem with non-partial coverage for networked robotic cameras
Abstract— We report our algorithmic development of the pframe problem that addresses the need of coordinating a set of p networked robotic pan-tilt-zoom cameras for n, (n > p)...
Yiliang Xu, Dezhen Song, Jingang Yi, A. Frank van ...
IEEEPACT
2006
IEEE
16 years 25 days ago
Program generation for the all-pairs shortest path problem
A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly com...
Sung-Chul Han, Franz Franchetti, Markus Püsch...