Sciweavers

2542 search results - page 26 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
ACL
2009
13 years 5 months ago
Automatic Cost Estimation for Tree Edit Distance Using Particle Swarm Optimization
Recently, there is a growing interest in working with tree-structured data in different applications and domains such as computational biology and natural language processing. Mor...
Yashar Mehdad
COMSUR
2011
221views Hardware» more  COMSUR 2011»
12 years 7 months ago
Computational Intelligence in Wireless Sensor Networks: A Survey
—Wireless sensor networks (WSNs) are networks of distributed autonomous devices that can sense or monitor physical or environmental conditions cooperatively. WSNs face many chall...
Raghavendra V. Kulkarni, A. Forster, Ganesh K. Ven...
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 5 months ago
Shortest path problem in rectangular complexes of global nonpositive curvature
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
Victor Chepoi, Daniela Maftuleac
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
14 years 1 months ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
14 years 1 months ago
Computing the epistasis variance of large-scale traveling salesman problems
The interaction among variables of an optimization problem is known as epistasis, and its degree is an important measure for the nonlinearity of the problem. We address the proble...
Dong-il Seo, Byung Ro Moon