Sciweavers

1404 search results - page 114 / 281
» Optimization problems in multiple-interval graphs
Sort
View
CISIM
2007
IEEE
15 years 4 months ago
A Particle Swarm Optimization Algorithm for Neighbor Selection in Peer-to-Peer Networks
Peer-to-peer (P2P) topology has significant influence on the performance, search efficiency and functionality, and scalability of the application. In this paper, we propose a P...
Shichang Sun, Ajith Abraham, Guiyong Zhang, Hongbo...
ISSS
1996
IEEE
103views Hardware» more  ISSS 1996»
15 years 2 months ago
Instruction Set Design and Optimizations for Address Computation in DSP Architectures
In this paper we investigate the problem of code generation for address computation for DSP processors. This work is divided into four parts. First, we propose a branch instructio...
Guido Araujo, Ashok Sudarsanam, Sharad Malik
ICALP
2000
Springer
15 years 1 months ago
An Optimal Minimum Spanning Tree Algorithm
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
Seth Pettie, Vijaya Ramachandran
DAM
1999
169views more  DAM 1999»
14 years 9 months ago
Approximating the Weight of Shallow Steiner Trees
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
Guy Kortsarz, David Peleg
CVPR
2010
IEEE
15 years 5 months ago
Efficient Piecewise Learning for Conditional Random Fields
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
Karteek Alahari, Phil Torr