Sciweavers

294 search results - page 25 / 59
» diagrams 2006
Sort
View
CLA
2006
13 years 11 months ago
Towards Concise Representation for Taxonomies of Epistemic Communities
We present an application of formal concept analysis aimed at creating and representing a meaningful structure of knowledge communities under the form of a lattice-based taxonomy ...
Camille Roth, Sergei A. Obiedkov, Derrick G. Kouri...
CORR
2006
Springer
100views Education» more  CORR 2006»
13 years 9 months ago
Using groups for investigating rewrite systems
We describe several technical tools that prove to be efficient for investigating the rewrite systems associated with an equational specification. These tools consist in introducing...
Patrick Dehornoy
IROS
2006
IEEE
106views Robotics» more  IROS 2006»
14 years 3 months ago
Where to Build a Door
— A room is a simple polygon with a prespecified point, called the door, on its boundary. Search starts at the door, and must detect any intruder that may be in the room, while ...
John Z. Zhang, Tsunehiko Kameda
CCCG
2006
13 years 11 months ago
An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
Asish Mukhopadhyay, Robert L. Scot Drysdale
CGVR
2006
13 years 11 months ago
A Bipolar Model for Region Simplification
In this paper we introduce an algorithm for simplifying a 2D discrete region. This algorithm is based on a bipolar model of regions. Given a discrete region, we cut its Voronoi di...
Yuqing Song, Jie Shen, David Yoon