Sciweavers

4714 search results - page 183 / 943
» The Complexity of Iterated Multiplication
Sort
View
COMCOM
2006
75views more  COMCOM 2006»
15 years 4 months ago
Finding a least hop(s) path subject to multiple additive constraints
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (...
Gang Cheng, Nirwan Ansari
BMCBI
2008
138views more  BMCBI 2008»
15 years 4 months ago
Systematic identification of yeast cell cycle transcription factors using multiple data sources
Background: Eukaryotic cell cycle is a complex process and is precisely regulated at many levels. Many genes specific to the cell cycle are regulated transcriptionally and are exp...
Wei-Sheng Wu, Wen-Hsiung Li
STOC
2007
ACM
85views Algorithms» more  STOC 2007»
16 years 4 months ago
Faster integer multiplication
For more than 35 years, the fastest known method for integer multiplication has been the Sch?onhage-Strassen algorithm running in time O(n log n log log n). Under certain restricti...
Martin Fürer
ISBI
2007
IEEE
15 years 10 months ago
Automated Tracking of Multiple C. Elegans with Articulated Models
We present a method for tracking and distinguishing multiple C. elegans in a video sequence, including when they are in physical contact with one another. The worms are modeled wi...
Kuang-Man Huang, Pamela C. Cosman, William R. Scha...
VTC
2007
IEEE
119views Communications» more  VTC 2007»
15 years 10 months ago
Adaptive Resource Allocation in Cellular OFDMA System with Multiple Relay Stations
— We address the problem of radio resource allocation in the Downlink (DL) of a cellular system with Relay Stations (RS), based on Orthogonal Frequency Division Multiple Access (...
Megumi Kaneko, Petar Popovski