Sciweavers

230 search results - page 28 / 46
» Faster algorithms for the characteristic polynomial
Sort
View
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
15 years 10 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...
FCCM
1999
IEEE
210views VLSI» more  FCCM 1999»
15 years 2 months ago
Algorithm Analysis and Mapping Environment for Adaptive Computing Systems: Further Results
Abstract We are developing an integrated algorithm analysis and mapping environment particularly tailored for signal processing applications on Adaptive Computing Systems ACS. Our ...
Eric K. Pauer, Paul D. Fiore, John M. Smith
ASC
2011
14 years 4 months ago
A note on the learning automata based algorithms for adaptive parameter selection in PSO
: PSO, like many stochastic search methods, is very sensitive to efficient parameter setting such that modifying a single parameter may cause a considerable change in the result. I...
Ali B. Hashemi, Mohammad Reza Meybodi
ICDE
2009
IEEE
163views Database» more  ICDE 2009»
15 years 11 months ago
Distance-Based Representative Skyline
Given an integer k, a representative skyline contains the k skyline points that best describe the tradeoffs among different dimensions offered by the full skyline. Although this to...
Yufei Tao, Ling Ding, Xuemin Lin, Jian Pei
TON
2008
125views more  TON 2008»
14 years 9 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni