16257 search results - page 3028 / 3252 » D-finiteness: algorithms and applications |
193
Voted
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
174
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We study a problem of quick detection of top-k Personalized PageRank lists. This problem has a number of important applications such as finding local cuts in large graphs, estima...
184
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
In this paper, we propose a systematic solution to the problem of scheduling delay-sensitive media data for transmission over time-varying wireless channels. We first formulate th...
179
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Learning structured representations has emerged as an important problem in many domains, including document and Web data mining, bioinformatics, and image analysis. One approach t...
224
click to vote
GIS
2010
ACM
15 years 5 months ago
2010
ACM
In this paper we focus on the problem of continuously monitoring the set of Reverse k-Nearest Neighbors (RkNNs) of a query object in a moving object database using a client server...