Sciweavers

526 search results - page 98 / 106
» Improved Decomposition of STGs
Sort
View
COCO
2009
Springer
105views Algorithms» more  COCO 2009»
14 years 4 months ago
Planar Graph Isomorphism is in Log-Space
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Th...
IEEEPACT
2005
IEEE
14 years 3 months ago
HUNTing the Overlap
Hiding communication latency is an important optimization for parallel programs. Programmers or compilers achieve this by using non-blocking communication primitives and overlappi...
Costin Iancu, Parry Husbands, Paul Hargrove
STACS
2005
Springer
14 years 3 months ago
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
Petros Drineas, Ravi Kannan, Michael W. Mahoney
UML
2005
Springer
14 years 3 months ago
Using Process Algebra to Validate Behavioral Aspects of Object-Oriented Models
We present in this paper a rigorous and automated based approach for the behavioral validation of control software systems. This approach relies on metamodeling, model-transformati...
Alban Rasse, Jean-Marc Perronne, Pierre-Alain Mull...
HICSS
2003
IEEE
144views Biometrics» more  HICSS 2003»
14 years 3 months ago
A Self-Disclosure Model for Personal Health Information
The use of information technologies (IT) to collect personal health information is growing in popularity via computer-assisted interviewing and a wide variety of healthcare Web si...
Lotus E. Kam, William G. Chismar