3146 search results - page 542 / 630 » Efficient Consequence Finding |
IPL
2002
13 years 9 months ago
2002
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
PRL
2007
13 years 9 months ago
2007
: We propose a new feature selection strategy based on rough sets and Particle Swarm Optimization (PSO). Rough sets has been used as a feature selection method with much success, b...
TKDE
2010
13 years 8 months ago
2010
—The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as findin...
TSE
2010
13 years 8 months ago
2010
—In the past, researchers have developed specialized programs to aid programmers in detecting concurrent programming errors such as deadlocks, livelocks, starvation, and data rac...
ICDCS
2009
IEEE
13 years 7 months ago
2009
IEEE
With the ever-increasing P2P Internet traffic, recently much attention has been paid to the topology mismatch between the P2P overlay and the underlying network due to the large a...