Sciweavers

7129 search results - page 537 / 1426
» Approximation Algorithms for Treewidth
Sort
View
ROBOCUP
2005
Springer
109views Robotics» more  ROBOCUP 2005»
16 years 21 days ago
Using the Max-Plus Algorithm for Multiagent Decision Making in Coordination Graphs
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...
Jelle R. Kok, Nikos A. Vlassis
COMPGEOM
1996
ACM
15 years 11 months ago
Developing a Practical Projection-Based Parallel Delaunay Algorithm
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
Guy E. Blelloch, Gary L. Miller, Dafna Talmor
ICCV
1995
IEEE
15 years 10 months ago
Algorithms for Implicit Deformable Models
This paper presents a framework for implicit deformable models and a pair of new algorithms for solving the nonlinear partial di erential equations that result from this framework...
Ross T. Whitaker
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
15 years 10 months ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
ICML
1994
IEEE
15 years 10 months ago
Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
David B. Skalak