20638 search results - page 3794 / 4128 » Network Computing |
174
click to vote
COMPGEOM
2004
ACM
16 years 2 days ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
218
Voted
DSRT
2003
IEEE
15 years 12 months ago
2003
IEEE
“Smart Things” are commonly understood as wireless ad-hoc networked, mobile, autonomous, special purpose computing appliances, usually interacting with their environment impli...
206
click to vote
FPGA
2000
ACM
15 years 10 months ago
2000
ACM
A method for evaluating and constructing sparse crossbars which are both area efficient and highly routable is presented. The evaluation method uses a network flow algorithm to ac...
196
click to vote
ANOR
2010
15 years 4 months ago
2010
The rectangular assignment problem is a generalization of the linear assignment problem (LAP): one wants to assign a number of persons to a smaller number of jobs, minimizing the ...
182
click to vote
EDBT
2004
ACM
16 years 6 months ago
2004
ACM
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...