Sciweavers

20441 search results - page 208 / 4089
» Locally Computable Structures
Sort
View
ENTCS
2010
117views more  ENTCS 2010»
14 years 12 months ago
Categorifying Computations into Components via Arrows as Profunctors
The notion of arrow by Hughes is an axiomatization of the algebraic structure possessed by structured computations in general. We claim that an arrow also serves as a basic compon...
Kazuyuki Asada, Ichiro Hasuo
ICRA
2003
IEEE
129views Robotics» more  ICRA 2003»
15 years 5 months ago
Optimal navigation and object finding without geometric maps or localization
In this paper we present a dynamic data structure, useful for robot navigation in an unknown, simplyconnected planar environment. The guiding philosophy in this work is to avoid t...
Benjamín Tovar, Steven M. LaValle, Rafael M...
PKDD
1999
Springer
130views Data Mining» more  PKDD 1999»
15 years 4 months ago
OPTICS-OF: Identifying Local Outliers
: For many KDD applications finding the outliers, i.e. the rare events, is more interesting and useful than finding the common cases, e.g. detecting criminal activities in E-commer...
Markus M. Breunig, Hans-Peter Kriegel, Raymond T. ...
CCCG
2004
15 years 1 months ago
Local properties of geometric graphs
We propose a definition of locality for properties of geometric graphs. We measure the local density of graphs using region-counting distances [8] between pairs of vertices, and w...
Jean Cardinal, Sébastien Collette, Stefan L...
COLING
1996
15 years 1 months ago
Statistical Method of Recognizing Local Cohesion
This paper presents a method for automatically recognizing local cohesion between utterances, which is one of the discourse structures in task-oriented spoken dialogues. More spec...
Naoto Katoh, Tsuyoshi Morimoto