Sciweavers

13603 search results - page 361 / 2721
» On the Complexity of Computing Treelength
Sort
View
BMCBI
2008
99views more  BMCBI 2008»
15 years 7 months ago
Towards a lightweight generic computational grid framework for biological research
Background: An increasing number of scientific research projects require access to large-scale computational resources. This is particularly true in the biological field, whether ...
Mark D. Halling-Brown, David S. Moss, Adrian J. Sh...
STOC
2006
ACM
120views Algorithms» more  STOC 2006»
16 years 7 months ago
Black-box constructions for secure computation
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Ere...
ASP
2005
Springer
16 years 1 months ago
A New Algorithm for Answer Set Computation
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
Giuliano Grossi, Massimo Marchi
CAISE
2003
Springer
16 years 23 days ago
Computing Event Dependencies in System Designs and Programs
Abstract. This paper presents a method to compute metrics that predict maintainability of a system with respect to its event processing. The metrics reflect the complexity of event...
Bruc Lee Liong, Leszek A. Maciaszek
IJON
2006
79views more  IJON 2006»
15 years 7 months ago
Fast computation with neural oscillators
This paper studies new spike-based models for winner-take-all computation and coincidence detection. In both cases, very fast convergence is achieved independent of initial condit...
Wei Wang 0008, Jean-Jacques E. Slotine