1458 search results - page 270 / 292 » Monads for incremental computing |
126
Voted
PG
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper we revisit the cells-and-portals visibility methods, originally developed for the special case of architectural interiors. We define an effectiveness measure for a ...
131
Voted
DEBS
2003
ACM
15 years 8 months ago
2003
ACM
Join algorithms must be re-designed when processing stream data instead of persistently stored data. Data streams are potentially infinite and the query result is expected to be ...
150
Voted
MM
2003
ACM
15 years 8 months ago
2003
ACM
In this paper, we propose an approach that retrieves motion of objects from the videos based on the dynamic time warping of view invariant characteristics. The motion is represent...
146
click to vote
MOBICOM
2003
ACM
15 years 8 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
180
click to vote
PPOPP
2003
ACM
15 years 8 months ago
2003
ACM
Large-scale cluster-based Internet services often host partitioned datasets to provide incremental scalability. The aggregation of results produced from multiple partitions is a f...