Sciweavers

14642 search results - page 2664 / 2929
» It's Time for a Change
Sort
View
180
Voted
JCT
2008
109views more  JCT 2008»
15 years 6 months ago
Decomposing Berge graphs and detecting balanced skew partitions
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...
Nicolas Trotignon
CORR
2007
Springer
151views Education» more  CORR 2007»
15 years 6 months ago
Distributed spatial multiplexing with 1-bit feedback
— We analyze the feasibility of distributed spatial multiplexing with limited feedback in a slow-fading interference network with MN non-cooperating single-antenna sources and M ...
J. Thukral, Helmut Bölcskei
JACM
2006
99views more  JACM 2006»
15 years 6 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
JOT
2008
105views more  JOT 2008»
15 years 6 months ago
Using Multiple Servers in Concurrent Garbage Collector
Object-oriented programming languages are being widely adopted as one of the most powerful languages due their flexibility and reusability. However, these languages suffer from me...
Ali Ebrahim El Desokey, Amany Sarhan, Seham Moawed
JMLR
2006
389views more  JMLR 2006»
15 years 6 months ago
A Very Fast Learning Method for Neural Networks Based on Sensitivity Analysis
This paper introduces a learning method for two-layer feedforward neural networks based on sensitivity analysis, which uses a linear training algorithm for each of the two layers....
Enrique Castillo, Bertha Guijarro-Berdiñas,...
« Prev « First page 2664 / 2929 Last » Next »