Sciweavers

626 search results - page 91 / 126
» On Approximability of Minimum Bisection Problem
Sort
View
IJON
2011
186views more  IJON 2011»
14 years 9 months ago
Discriminative structure selection method of Gaussian Mixture Models with its application to handwritten digit recognition
, Yunde Jia Model structure selection is currently an open problem in modeling data via Gaussian Mixture Models (GMM). This paper proposes a discriminative method to select GMM st...
Xuefeng Chen, Xiabi Liu, Yunde Jia
CORR
2007
Springer
126views Education» more  CORR 2007»
15 years 5 months ago
Dial a Ride from k-forest
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath ...
INFOCOM
2008
IEEE
16 years 10 days ago
Embracing Interference in Ad Hoc Networks Using Joint Routing and Scheduling with Multiple Packet Reception
— We present an approach that takes advantage of multi-packet reception (MPR) to reduce the negative effects of multiple access interference and therefore increase the capacity o...
Xin Wang, J. J. Garcia-Luna-Aceves
HSNMC
2003
Springer
102views Multimedia» more  HSNMC 2003»
15 years 11 months ago
A RTT-based Partitioning Algorithm for a Multi-rate Reliable Multicast Protocol
Various Internet applications involve multiple parties and usually adopt a one-to-many communication paradigm (multicast). The presence of multiple receivers in a multicast session...
Moufida Maimour, CongDuc Pham
STOC
1998
ACM
79views Algorithms» more  STOC 1998»
15 years 10 months ago
Multicasting in Heterogeneous Networks
In heterogeneousnetworks sending messagesmay incur different delayson different edges,and eachprocessormay havea different switching timebetweenmessages.Thewell studiedTelephonemo...
Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch S...