Sciweavers

2745 search results - page 234 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
15 years 9 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
113
Voted
GD
2009
Springer
15 years 9 months ago
Orthogonal Connector Routing
Abstract. Orthogonal connectors are used in a variety of common network diagrams. Most interactive diagram editors provide orthogonal connectors with some form of automatic connect...
Michael Wybrow, Kim Marriott, Peter J. Stuckey
CNSR
2005
IEEE
210views Communications» more  CNSR 2005»
15 years 6 months ago
A Framework for Self-Management of Hybrid Wireless Networks Using Autonomic Computing Principles
The dramatic increase in the number of mobile subscribers has put a significant resource and service provisioning strain on current cellular networks in particular in terms of mu...
Chong Shen, Dirk Pesch, James Irvine
ICDE
2010
IEEE
322views Database» more  ICDE 2010»
16 years 4 months ago
XML-Based Computation for Scientific Workflows
Scientific workflows are increasingly used for rapid integration of existing algorithms to form larger and more comgrams. Such workflows promise to provide more abstract, yet execu...
Bertram Ludäscher, Daniel Zinn, Shawn Bowers
BMCBI
2006
122views more  BMCBI 2006»
15 years 4 months ago
Computational reconstruction of transcriptional regulatory modules of the yeast cell cycle
Background: A transcriptional regulatory module (TRM) is a set of genes that is regulated by a common set of transcription factors (TFs). By organizing the genome into TRMs, a liv...
Wei-Sheng Wu, Wen-Hsiung Li, Bor-Sen Chen