Sciweavers

79 search results - page 14 / 16
» A decomposition procedure based on approximate Newton direct...
Sort
View
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
13 years 12 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
CORR
2010
Springer
190views Education» more  CORR 2010»
13 years 6 months ago
Bidimensionality and EPTAS
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
VTC
2007
IEEE
100views Communications» more  VTC 2007»
14 years 29 days ago
Downlink Steered Space-Time Spreading Assisted Generalised Multicarrier DS-CDMA Using Sphere-Packing-Aided Multilevel Coding
— This paper presents a novel generalised Multi-Carrier Direct Sequence Code Division Multiple Access (MC DS-CDMA) system invoking smart antennas for improving the achievable per...
Mohammed El-Hajjar, Ronald Y. S. Tee, Hu Bin, Lie-...
EMMCVPR
2005
Springer
14 years 6 days ago
Brain Image Analysis Using Spherical Splines
We propose a novel technique based on spherical splines for brain surface representation and analysis. This research is strongly inspired by the fact that, for brain surfaces, it i...
Ying He 0001, Xin Li, Xianfeng Gu, Hong Qin
UAI
2000
13 years 8 months ago
Gaussian Process Networks
In this paper we address the problem of learning the structure of a Bayesian network in domains with continuous variables. This task requires a procedure for comparing different c...
Nir Friedman, Iftach Nachman