Sciweavers

4110 search results - page 64 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
CORR
2008
Springer
108views Education» more  CORR 2008»
15 years 3 months ago
Efficient Isomorphism Testing for a Class of Group Extensions
Abstract. The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved eff...
François Le Gall
137
Voted
FOCS
2004
IEEE
15 years 7 months ago
Approximating Edit Distance Efficiently
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...
Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, ...
120
Voted
ISPD
1998
ACM
88views Hardware» more  ISPD 1998»
15 years 8 months ago
An efficient technique for device and interconnect optimization in deep submicron designs
In this paper, we formulate a new class of optimization problem, named the general CH-posynomial program, and reveal the general dominance property. We propose an efcient algorith...
Jason Cong, Lei He
151
Voted
GECCO
2006
Springer
192views Optimization» more  GECCO 2006»
15 years 7 months ago
Optimising cancer chemotherapy using an estimation of distribution algorithm and genetic algorithms
This paper presents a methodology for using heuristic search methods to optimise cancer chemotherapy. Specifically, two evolutionary algorithms - Population Based Incremental Lear...
Andrei Petrovski, Siddhartha Shakya, John A. W. Mc...
WAIM
2010
Springer
15 years 1 months ago
Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs
SimRank has been considered as one of the promising link-based ranking algorithms to evaluate similarities of web documents in many modern search engines. In this paper, we investi...
Weiren Yu, Xuemin Lin, Jiajin Le