Sciweavers

432 search results - page 86 / 87
» Minimum Weight Pseudo-Triangulations
Sort
View
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
13 years 7 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
ESANN
2004
13 years 7 months ago
Forbidden magnification? II
The twin of this paper, "Forbidden Magnification? I." [1], presents systematic SOM simulations with the explicit magnification control scheme of Bauer, Der, and Herrmann ...
Erzsébet Merényi, Abha Jain
CGF
2010
218views more  CGF 2010»
13 years 5 months ago
Mesh Snapping: Robust Interactive Mesh Cutting Using Fast Geodesic Curvature Flow
This paper considers the problem of interactively finding the cutting contour to extract components from a given mesh. Some existing methods support cuts of arbitrary shape but re...
Juyong Zhang, Chunlin Wu, Jianfei Cai, Jianmin Zhe...
DC
2010
13 years 5 months ago
A knowledge-based analysis of global function computation
Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function f whose value depends...
Joseph Y. Halpern, Sabina Petride
JAIR
2008
119views more  JAIR 2008»
13 years 5 months ago
A Multiagent Reinforcement Learning Algorithm with Non-linear Dynamics
Several multiagent reinforcement learning (MARL) algorithms have been proposed to optimize agents' decisions. Due to the complexity of the problem, the majority of the previo...
Sherief Abdallah, Victor R. Lesser