Sciweavers

6740 search results - page 996 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
199
Voted
WABI
2001
Springer
142views Bioinformatics» more  WABI 2001»
15 years 11 months ago
Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
Juris Viksna, David Gilbert
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
15 years 10 months ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...
SIGSOFT
1995
ACM
15 years 10 months ago
Precise Interprocedural Chopping
The notion of a program slice, originally introduced by Mark Weiser, is a fundamental operation for addressing many software-engineering problems, including program understanding,...
Thomas W. Reps, Genevieve Rosay
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
15 years 10 months ago
Scheduling with Bully Selfish Jobs
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...
Tami Tamir
EUROCRYPT
2008
Springer
15 years 8 months ago
Almost-Everywhere Secure Computation
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
Juan A. Garay, Rafail Ostrovsky