3405 search results - page 127 / 681 » Factoring Groups Efficiently |
175
click to vote
IPCO
1993
15 years 7 months ago
1993
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
160
click to vote
TCAD
2008
15 years 6 months ago
2008
Abstract--Recent analytical global placers use density constraints to approximate nonoverlap constraints, and these show very successful results. This paper unifies a wide range of...
149
click to vote
IPPS
2007
IEEE
16 years 23 days ago
2007
IEEE
An interest group-based P2P browser cache collaborative system, named IntraCache, is proposed in the paper. IntraCache is scalable, resilient to node failures and easy to manage n...
146
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
We present algorithms for improved Viterbi decoding for the case of hidden semi-Markov models. By carefully constructing directed acyclic graphs, we pose the decoding problem as t...
209
click to vote
ACST
2006
15 years 7 months ago
2006
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...