4865 search results - page 228 / 973 » The Complexity of Graph Connectivity |
147
click to vote
AFRIGRAPH
2001
ACM
15 years 8 months ago
2001
ACM
This article presents a gesture detection and analysis framework for modelling multimodal interactions. It is particulary designed for its use in Virtual Reality (VR) applications...
151
click to vote
ASPDAC
2008
ACM
15 years 7 months ago
2008
ACM
Abstract--In this paper, the problem of bus driven floorplanning is addressed. Given a set of modules and bus specifications, a floorplan solution including the bus routes will be ...
150
click to vote
BIS
2008
15 years 6 months ago
2008
The deep Web has many challenges to be solved. Among them is schema matching. In this paper, we build a conceptual connection between the schema matching problem SMP and the fuzzy ...
125
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We propose distributed algorithms to automatically deploy a group of mobile robots to partition and provide coverage of a non-convex environment. To handle arbitrary nonconvex envi...
138
Voted
COMBINATORICS
2007
15 years 5 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...