Sciweavers

164 search results - page 17 / 33
» Adaptive Algorithms for Planar Convex Hull Problems
Sort
View
ICRA
1994
IEEE
111views Robotics» more  ICRA 1994»
13 years 11 months ago
From Spider Robots to Half Disk Robots
We study the problem of computing the set F of accessible and stable placements of a spider robot. The body of this robot is a single point and the legs are line segments attached...
Jean-Daniel Boissonnat, Olivier Devillers, Sylvain...
SDM
2009
SIAM
161views Data Mining» more  SDM 2009»
14 years 4 months ago
Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems.
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
Hiroki Arimura, Takeaki Uno
JCO
2010
169views more  JCO 2010»
13 years 6 months ago
An almost four-approximation algorithm for maximum weight triangulation
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
Shiyan Hu
RC
2000
99views more  RC 2000»
13 years 7 months ago
Interval Constraint Plotting for Interactive Visual Exploration of Implicitly Defined Relations
Conventional plotting programs adopt techniques such as adaptive sampling to approximate, but not to guarantee, correctness and completeness in graphing functions. Moreover, implic...
Timothy J. Hickey, Zhe Qju, Maarten H. van Emden
KDD
2004
ACM
123views Data Mining» more  KDD 2004»
14 years 8 months ago
A DEA approach for model combination
This paper proposes a novel Data Envelopment Analysis (DEA) based approach for model combination. We first prove that for the 2-class classification problems DEA models identify t...
Zhiqiang Zheng, Balaji Padmanabhan, Haoqiang Zheng