3359 search results - page 585 / 672 » A Simplified Idea Algorithm |
HIPC
2003
Springer
14 years 1 months ago
2003
Springer
Traditional methods for data mining typically make the assumption that data is centralized and static. This assumption is no longer tenable. Such methods waste computational and I/...
SWAT
2010
Springer
14 years 26 days ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
SIGGRAPH
1997
ACM
14 years 8 hour ago
1997
ACM
Interactively manipulating the geometry of complex, globally illuminated scenes has to date proven an elusive goal. Previous attempts have failed to provide interactive updates of...
DEXA
2008
Springer
13 years 9 months ago
2008
Springer
We address the problem of maintaining continuous skyline queries efficiently over dynamic objects with d dimensions. Skyline queries are an important new search capability for mult...
NETWORKING
2008
13 years 9 months ago
2008
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...