Sciweavers

966 search results - page 97 / 194
» Small Alliances in Graphs
Sort
View
TACAS
2009
Springer
212views Algorithms» more  TACAS 2009»
14 years 4 months ago
Semantic Reduction of Thread Interleavings in Concurrent Programs
Abstract. We propose a static analysis framework for concurrent programs based on reduction of thread interleavings using sound invariants on the top of partial order techniques. S...
Vineet Kahlon, Sriram Sankaranarayanan, Aarti Gupt...
WG
2009
Springer
14 years 4 months ago
The Parameterized Complexity of Some Minimum Label Problems
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
Michael R. Fellows, Jiong Guo, Iyad A. Kanj
ECSQARU
2009
Springer
14 years 4 months ago
Triangulation Heuristics for BN2O Networks
A BN2O network is a Bayesian network having the structure of a bipartite graph with all edges directed from one part (the top level) toward the other (the bottom level) and where a...
Petr Savický, Jirí Vomlel
DATE
2005
IEEE
118views Hardware» more  DATE 2005»
14 years 3 months ago
An Iterative Algorithm for Battery-Aware Task Scheduling on Portable Computing Platforms
In this work we consider battery powered portable systems which either have Field Programmable Gate Arrays (FPGA) or voltage and frequency scalable processors as their main proces...
Jawad Khan, Ranga Vemuri
FSE
2005
Springer
116views Cryptology» more  FSE 2005»
14 years 3 months ago
Narrow T-Functions
T-functions were introduced by Klimov and Shamir in a series of papers during the last few years. They are of great interest for cryptography as they may provide some new building ...
Magnus Daum