276 search results - page 43 / 56 » The Complexity of Computing Maximal Word Functions |
BMCBI
2007
13 years 7 months ago
2007
Several systems have been presented in the last years in order to manage the complexity of large microarray experiments. Although good results have been achieved, most systems ten...
VTC
2006
IEEE
14 years 1 months ago
2006
IEEE
A scheduling scheme for MIMO systems which has the capability of obtaining multiuser diversity gain and controlling the link connection ratio among users simultaneously is proposed...
STOC
2000
ACM
13 years 12 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
ACCV
2009
Springer
14 years 2 months ago
2009
Springer
Graph cuts based interactive segmentation has become very popular over the last decade. In standard graph cuts, the extraction of foreground object in a complex background often le...
GC
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. Is it possible to treat large scale distributed systems as physical systems? The importance of that question stems from the fact that the behavior of many P2P systems is ...