Sciweavers

15033 search results - page 19 / 3007
» Complexity Theory and Algorithms
Sort
View
120
Voted
JDCTA
2010
228views more  JDCTA 2010»
14 years 4 months ago
Research and Progress of Cluster Algorithms based on Granular Computing
Granular Computing (GrC), a knowledge-oriented computing which covers the theory of fuzzy information granularity, rough set theory, the theory of quotient space and interval comp...
Shifei Ding, Li Xu, Hong Zhu, Liwen Zhang
89
Voted
ISSAC
2007
Springer
142views Mathematics» more  ISSAC 2007»
15 years 3 months ago
Fast arithmetic for triangular sets: from theory to practice
We study arithmetic operations for triangular families of polynomials, concentrating on multiplication in dimension zero. By a suitable extension of fast univariate Euclidean divi...
Xin Li, Marc Moreno Maza, Éric Schost
76
Voted
JCB
2007
78views more  JCB 2007»
14 years 9 months ago
Sorting by Reciprocal Translocations via Reversals Theory
The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of genome...
Michal Ozery-Flato, Ron Shamir
CN
2004
85views more  CN 2004»
14 years 9 months ago
The multicast address allocation problem: theory and practice
Abstract-- In this paper, we perform the first comprehensive study of the multicast address allocation problem. We analyze this problem both within its context as a classic resourc...
Daniel Zappala, Virginia Mary Lo, Chris GauthierDi...
79
Voted
COMPGEOM
2009
ACM
15 years 2 months ago
Visibility maps of realistic terrains have linear smoothed complexity
We study the complexity of the visibility map of terrains whose triangles are fat, not too steep and have roughly the same size. It is known that the complexity of the visibility ...
Mark de Berg, Herman J. Haverkort, Constantinos P....