Sciweavers

2412 search results - page 278 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
122
Voted
MTA
2006
173views more  MTA 2006»
15 years 3 months ago
Active learning in very large databases
Abstract. Query-by-example and query-by-keyword both suffer from the problem of "aliasing," meaning that example-images and keywords potentially have variable interpretat...
Navneet Panda, Kingshy Goh, Edward Y. Chang
IPPS
2005
IEEE
15 years 9 months ago
On the Optimal Placement of Secure Data Objects over Internet
Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changi...
Manghui Tu, Peng Li, Qingkai Ma, I-Ling Yen, Farok...
134
Voted
GECCO
2000
Springer
122views Optimization» more  GECCO 2000»
15 years 7 months ago
Genetic Programming with Statically Scoped Local Variables
This paper presents an extension to genetic programming to allow the evolution of programs containing local variables with static scope which obey the invariant that all variables...
Evan Kirshenbaum
138
Voted
CN
2007
149views more  CN 2007»
15 years 3 months ago
Adaptive congestion protocol: A congestion control protocol with learning capability
There is strong evidence that the current implementation of TCP will perform poorly in future high speed networks. To address this problem many congestion control protocols have b...
Marios Lestas, Andreas Pitsillides, Petros A. Ioan...
144
Voted
VTC
2008
IEEE
236views Communications» more  VTC 2008»
15 years 10 months ago
Apriori-LLR-Threshold-Assisted K-Best Sphere Detection for MIMO Channels
—When the maximum number of best candidates retained at each tree search level of the K-Best Sphere Detection (SD) is kept low for the sake of maintaining a low memory requiremen...
Li Wang, Lei Xu, Sheng Chen, Lajos Hanzo