Sciweavers

5356 search results - page 102 / 1072
» Adventures in time and space
Sort
View
CCCG
2010
15 years 1 months ago
Finding minimal bases in arbitrary spline spaces
In this work we describe a general algorithm to find a finite-element basis with minimum total support for an arbitrary spline space, given any basis for that same space. The runn...
Ana Paula Malheiro, Jorge Stolfi
INFOCOM
2011
IEEE
14 years 3 months ago
Approximate distance queries and compact routing in sparse graphs
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...
CORR
2010
Springer
72views Education» more  CORR 2010»
15 years 3 hour ago
Fast Moment Estimation in Data Streams in Optimal Space
We give a space-optimal algorithm with update time O(log2 (1/) log log(1/)) for (1
Daniel M. Kane, Jelani Nelson, Ely Porat, David P....
SOSP
2005
ACM
15 years 8 months ago
FS2: dynamic data replication in free disk space for improving disk performance and energy consumption
Disk performance is increasingly limited by its head positioning latencies, i.e., seek time and rotational delay. To reduce the head positioning latencies, we propose a novel tech...
Hai Huang, Wanda Hung, Kang G. Shin
IAT
2006
IEEE
15 years 6 months ago
Collaborative RPD Agents Assisting Decision Making in Active Decision Spaces
One of the challenging issues in a distributed time sensitive information rich environment is how to assist the decision makers to make decisions quickly and effectively. This pap...
Guruprasad Airy, Po-Chun Chen, Xiaocong Fan, John ...