Sciweavers

1644 search results - page 22 / 329
» Finding Dominators in Practice
Sort
View
ECIS
2003
13 years 10 months ago
Finding a home for web-based information systems - perusing the landscape
Information systems (IS) and software engineering (SE) have shared the domain of systems and software development for several decades with too little overlap in practice and resea...
Chris Barry, Jeremy Brown
STOC
2002
ACM
140views Algorithms» more  STOC 2002»
14 years 9 months ago
Finding nearest neighbors in growth-restricted metrics
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
David R. Karger, Matthias Ruhl
ISDA
2008
IEEE
14 years 3 months ago
Towards a Suitable Reconciliation of the Findings in Collaborative Fuzzy Clustering
This study is concerned with the application of multi-objective particle swarm optimization (MOPSO) approaches to the framework of collaborative fuzzy clustering. In particular, t...
Rafael Falc, Benoît Depaire, Koen Vanhoof, A...
CRYPTO
2007
Springer
144views Cryptology» more  CRYPTO 2007»
14 years 2 months ago
Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
Coppersmith described at Eurocrypt 96 an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction. A simpler algorithm was later pro...
Jean-Sébastien Coron
PR
2002
112views more  PR 2002»
13 years 8 months ago
Finding approximate palindromes in strings
We introduce a novel de nition of approximate palindromes in strings, and provide an algorithm to nd all maximal approximate palindromes in a string with up to k errors. Our de ni...
Alexandre H. L. Porto, Valmir C. Barbosa