8728 search results - page 199 / 1746 » On Reduct Construction Algorithms |
153
click to vote
IJCGA
2008
15 years 6 months ago
2008
Given a set S of n point sites in the plane, the City Voronoi diagram partitions the plane into the Voronoi regions of the sites, with respect to the City metric. This metric is i...
187
click to vote
IROS
2007
IEEE
16 years 25 days ago
2007
IEEE
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
182
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
153
click to vote
DAC
2003
ACM
16 years 7 months ago
2003
ACM
Exploring a large portion of the microprocessor design space requires the rapid development of efficient simulators. While some systems support rapid model development through the...
144
click to vote
IROS
2007
IEEE
16 years 25 days ago
2007
IEEE
— We describe decentralized algorithms by which a swarm of simple, independent, autonomous robots can build two-dimensional structures using square building blocks. These structu...