Sciweavers

1024 search results - page 36 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
14 years 11 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
ICALP
2009
Springer
15 years 10 months ago
Improved Algorithms for Latency Minimization in Wireless Networks
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
Alexander Fanghänel, Berthold Vöcking, T...
ICDM
2003
IEEE
135views Data Mining» more  ICDM 2003»
15 years 3 months ago
An Algorithm for the Exact Computation of the Centroid of Higher Dimensional Polyhedra and its Application to Kernel Machines
The Support Vector Machine (SVM) solution corresponds to the centre of the largest sphere inscribed in version space. Alternative approaches like Bayesian Point Machines (BPM) and...
Frédéric Maire
GLOBECOM
2006
IEEE
15 years 3 months ago
Capacity Maximizing Packet Scheduling Algorithms for Interconnection Networks with Finite Buffers
Abstract— In this paper, we analyze the throughput of interconnection networks, viewed as multi-stage queueing networks with infinite input queues, but finite internal cross-st...
Kevin Ross, Nicholas Bambos
TASLP
2008
98views more  TASLP 2008»
14 years 9 months ago
Unsupervised Single-Channel Music Source Separation by Average Harmonic Structure Modeling
Source separation of musical signals is an appealing but difficult problem, especially in the single-channel case. In this paper, an unsupervised single-channel music source separa...
Zhiyao Duan, Yungang Zhang, Changshui Zhang, Zhenw...