Sciweavers

10988 search results - page 459 / 2198
» Algorithmic Folding Complexity
Sort
View
205
Voted
CORR
2011
Springer
188views Education» more  CORR 2011»
15 years 1 months ago
Digraph description of k-interchange technique for optimization over permutations and adaptive algorithm system
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
Mark Sh. Levin
TCS
2011
15 years 1 months ago
An algorithmic framework for network reconstruction
Models of biological systems and phenomena are of high scientific interest and practical relevance, but not always easy to obtain due to their inherent complexity. To gain the re...
Markus Durzinsky, Annegret Wagler, Robert Weismant...
ICIP
2000
IEEE
16 years 8 months ago
A Fast Hierarchical Algorithm of Maximum Intensity Projection
The maximum intensity projection (MIP) is a useful tool to visualize 3D images. The processing time of the MIP depends on the number of voxels of the 3D data. Therefore, it is ver...
Keun Ho Kim, Min Jeong Kwon, Hyun Wook Park
SAC
2010
ACM
16 years 1 months ago
A simple role mining algorithm
Complex organizations need to establish access control policies in order to manage access to restricted resources. Role Based Access Control paradigm has been introduced in ’90 ...
Carlo Blundo, Stelvio Cimato
GLOBECOM
2008
IEEE
16 years 25 days ago
Joint Scheduling and Rate Control Algorithms for Stable Throughput Maximization under Channel Estimation in Single-Hop Wireless
—We characterize the stability region of wireless, single-hop networks with time-varying imperfect channels. We define a joint scheduling and transmission rate control policy th...
Anna Pantelidou, Anthony Ephremides