1291 search results - page 125 / 259 » Computing the multiplicity structure in solving polynomial s... |
DATE
2006
IEEE
15 years 7 months ago
2006
IEEE
In many computer systems with large data computations, the delay of memory access is one of the major performance bottlenecks. In this paper, we propose an enhanced field remappi...
108
click to vote
WIOPT
2010
IEEE
2010
IEEE
Low complexity algorithms for relay selection and power control in interference-limited environments
15 years 2 days ago
Abstract—We consider an interference-limited wireless network, where multiple source-destination pairs compete for the same pool of relay nodes. In an attempt to maximize the sum...
121
click to vote
ICFEM
2009
Springer
14 years 11 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
129
click to vote
ALMOB
2006
15 years 1 months ago
2006
The use of Chaos Game Representation (CGR) or its generalization, Universal Sequence Maps (USM), to describe the distribution of biological sequences has been found objectionable ...
94
Voted
EICS
2010
ACM
15 years 6 months ago
2010
ACM
In e-business, creating a common concept set for business integration, interoperation and interaction has to consider the heterogeneity reality of different interpretations from m...