Sciweavers

4526 search results - page 645 / 906
» Algorithmic problems related to the Internet
Sort
View
PODS
2006
ACM
95views Database» more  PODS 2006»
16 years 4 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
TNN
1998
123views more  TNN 1998»
15 years 4 months ago
A general framework for adaptive processing of data structures
—A structured organization of information is typically required by symbolic processing. On the other hand, most connectionist models assume that data are organized according to r...
Paolo Frasconi, Marco Gori, Alessandro Sperduti
ATAL
2011
Springer
14 years 4 months ago
Towards a unifying characterization for quantifying weak coupling in dec-POMDPs
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
Stefan J. Witwicki, Edmund H. Durfee
SIGMETRICS
2008
ACM
116views Hardware» more  SIGMETRICS 2008»
15 years 4 months ago
Optimal sampling in state space models with applications to network monitoring
Advances in networking technology have enabled network engineers to use sampled data from routers to estimate network flow volumes and track them over time. However, low sampling ...
Harsh Singhal, George Michailidis
ICCV
2007
IEEE
16 years 6 months ago
Removing Non-Uniform Motion Blur from Images
We propose a method for removing non-uniform motion blur from multiple blurry images. Traditional methods focus on estimating a single motion blur kernel for the entire image. In ...
Sunghyun Cho, Yasuyuki Matsushita, Seungyong Lee