Sciweavers

1330 search results - page 220 / 266
» Dynamic Data Structures for Fat Objects and Their Applicatio...
Sort
View
ICPR
2002
IEEE
16 years 2 months ago
Relational Graph Labelling Using Learning Techniques and Markov Random Fields
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
Denis Rivière, Jean-Francois Mangin, Jean-M...
WADS
2007
Springer
156views Algorithms» more  WADS 2007»
15 years 7 months ago
Cuttings for Disks and Axis-Aligned Rectangles
We present new asymptotically tight bounds on cuttings, a fundamental data structure in computational geometry. For n objects in space and a parameter r ∈ N, an 1 r -cutting is ...
Eynat Rafalin, Diane L. Souvaine, Csaba D. T&oacut...
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
16 years 1 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
SPRINGSIM
2010
14 years 11 months ago
SES-based ontological process for high level information fusion
—Data Fusion (DF) process is in the interest of the military community since it provides the opportunity to achieve information superiority. The System Entity Structure (SES) is ...
Hojun Lee, Bernard P. Zeigler
FUIN
2002
107views more  FUIN 2002»
15 years 1 months ago
Towards an Ontology of Approximate Reason
Abstract. This article introduces structural aspects in an ontology of approximate reason. The basic assumption in this ontology is that approximate reason is a capability of an ag...
James F. Peters, Andrzej Skowron, Jaroslaw Stepani...