1282 search results - page 134 / 257 » Algorithms for Large, Sparse Network Alignment Problems |
164
Voted
MOBIDE
2006
ACM
15 years 8 months ago
2006
ACM
An important problem in mobile ad-hoc wireless sensor networks is the localization of individual nodes, i.e., each node’s awareness of its position relative to the network. In t...
155
click to vote
ACCV
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We propose an algorithm for Sparse Bayesian Classification for multi-class problems using Automatic Relevance Determination(ARD). Unlike other approaches which treat mult...
123
click to vote
JCO
2010
15 years 1 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
137
click to vote
CIKM
2010
Springer
14 years 9 months ago
2010
Springer
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...
102
Voted
CONEXT
2008
ACM
15 years 4 months ago
2008
ACM
In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the co...