Sciweavers

2498 search results - page 395 / 500
» Data Structures with Unpredictable Timing
Sort
View
CIKM
2010
Springer
15 years 1 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
CCR
2011
14 years 9 months ago
Two-way TCP connections: old problem, new insight
Many papers explain the drop of download performance when two TCP connections in opposite directions share a common bottleneck link by ACK compression, the phenomenon in which dow...
Martin Heusse, Sears A. Merritt, Timothy X. Brown,...
CVPR
2004
IEEE
16 years 4 months ago
High-Zoom Video Hallucination by Exploiting Spatio-Temporal Regularities
In this paper, we consider the problem of super-resolving a human face video by a very high (?16) zoom factor. Inspired by recent literature on hallucination and examplebased lear...
Göksel Dedeoglu, Jonas August, Takeo Kanade
SSD
2009
Springer
180views Database» more  SSD 2009»
15 years 9 months ago
Indexing Moving Objects Using Short-Lived Throwaway Indexes
With the exponential growth of moving objects data to the Gigabyte range, it has become critical to develop effective techniques for indexing, updating, and querying these massive ...
Jens Dittrich, Lukas Blunschi, Marcos Antonio Vaz ...
GIS
2005
ACM
16 years 3 months ago
ASPEN: an adaptive spatial peer-to-peer network
Geographic Information Systems (GIS) are increasingly managing very large sets of data and hence a centralized data repository may not always provide the most scalable solution. H...
Haojun Wang, Roger Zimmermann, Wei-Shinn Ku