501 search results - page 19 / 101 » Rough Sets and Approximation Schemes |
ICDE
2012
IEEE
12 years 9 days ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
IADIS
2004
13 years 11 months ago
2004
An event is a short and data-rich document and it refers to an instance of an announcement type such as "wedding", "birth", "graduation", "aucti...
INFOCOM
2008
IEEE
14 years 4 months ago
2008
IEEE
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...
CSR
2007
Springer
14 years 4 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
VISUALIZATION
1996
IEEE
14 years 2 months ago
1996
IEEE
This can be a costly operation. When the data is arranged according to its three-dimensional coordinates, calculating the contour surfaces requires examining each data cell. Avoidi...