Sciweavers

2252 search results - page 368 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
IPPS
2000
IEEE
14 years 1 months ago
Optimal All-to-All Personalized Exchange in a Class of Optical Multistage Networks
All-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important parallel computing/networking applications. In this paper,...
Yuanyuan Yang, Jianchao Wang
RTCSA
1999
IEEE
14 years 1 months ago
Incorporating Error Recovery into the Imprecise Computation Model
In this paper; we describe optimal algorithmsfor incorporating error recovery in the imprecise computation model. In that model eack task compriser a mandatory and an optional par...
Hakan Aydin, Rami G. Melhem, Daniel Mossé
ICLP
1997
Springer
14 years 1 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
COLT
1992
Springer
14 years 1 months ago
Language Learning from Stochastic Input
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...
Shyam Kapur, Gianfranco Bilardi
ICC
2007
IEEE
168views Communications» more  ICC 2007»
14 years 24 days ago
Analysis and Optimization of Power Control in Multiuser Cognitive Wireless Networks
In this paper, the problem about power control in multiuser cognitive networks is addressed. The scenario we study is a heterogeneous network, where multiple cognitive (without the...
Peng Cheng, Guanding Yu, Zhaoyang Zhang, Peiliang ...