5100 search results - page 130 / 1020 » The Linear Complexity of a Graph |
175
click to vote
ICIP
2000
IEEE
16 years 4 months ago
2000
IEEE
We present an algorithm that extracts the largest shape within a specificclass, starting from a set of image edgels. The algorithm inherits the Best-First Segmentation approach [jp...
144
click to vote
ICFP
2008
ACM
16 years 3 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
118
click to vote
EKAW
2000
Springer
15 years 7 months ago
2000
Springer
The goal of conceptual clustering is to build a set of embedded classes, which cluster objects based on their similarities. Knowledge organization aims at generating the set of mos...
144
click to vote
CISS
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract-- When monitoring interactions within a social network, meetings or contacts between different members of the network are recorded. This paper addresses the problem of usi...
109
Voted
EJC
2007
15 years 3 months ago
2007
Abstract. Given a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we define a simplicial complex ∆A,H as the subdivision of the link of A induced...