1813 search results - page 166 / 363 » Instance Pruning Techniques |
189
click to vote
JCM
2007
15 years 6 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
146
click to vote
PVLDB
2008
15 years 6 months ago
2008
We study the efficient evaluation of top-k queries over data items, where the score of each item is dynamically computed by applying an item-specific function whose parameter valu...
198
click to vote
TKDE
2010
15 years 4 months ago
2010
— The data management community has recently begun to consider declarative network routing and distributed acquisition: e.g., sensor networks that execute queries about contiguou...
182
click to vote
VIS
2007
IEEE
16 years 7 months ago
2007
IEEE
Analyzing, visualizing, and illustrating changes within time-varying volumetric data is challenging due to the dynamic changes occurring between timesteps. The changes and variatio...
156
click to vote
ISCC
2006
IEEE
16 years 15 days ago
2006
IEEE
— Security and QoS are two main issues for a successful wide deployment of multicast services. For instance, in a multicast streaming application, a receiver would require a data...