Sciweavers

114 search results - page 10 / 23
» Sets of elements that pairwise generate a linear group
Sort
View
STACS
1999
Springer
13 years 11 months ago
On Quantum Algorithms for Noncommutative Hidden Subgroups
Quantum algorithms for factoring and finding discrete logarithms have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the ...
Mark Ettinger, Peter Høyer
INFOCOM
2006
IEEE
14 years 1 months ago
To Peer or Not to Peer: Modeling the Evolution of the Internet's AS-Level Topology
— Internet connectivity at the AS level, defined in terms of pairwise logical peering relationships, is constantly evolving. This evolution is largely a response to economic, po...
Hyunseok Chang, Sugih Jamin, Walter Willinger
JCC
2008
88views more  JCC 2008»
13 years 7 months ago
A self-organizing algorithm for molecular alignment and pharmacophore development
Abstract: We present a method for simultaneous three-dimensional (3D) structure generation and pharmacophorebased alignment using a self-organizing algorithm called Stochastic Prox...
Deepak Bandyopadhyay, Dimitris K. Agrafiotis
COMBINATORICS
2002
92views more  COMBINATORICS 2002»
13 years 7 months ago
Pattern Avoidance in Permutations: Linear and Cyclic Orders
: We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the f...
Antoine Vella
WEA
2005
Springer
97views Algorithms» more  WEA 2005»
14 years 1 months ago
Multiple-Winners Randomized Tournaments with Consensus for Optimization Problems in Generic Metric Spaces
Abstract. Extensions of the randomized tournaments techniques introduced in [6, 7] to approximate solutions of 1-median and diameter computation of finite subsets of general metri...
Domenico Cantone, Alfredo Ferro, Rosalba Giugno, G...