570 search results - page 44 / 114 » Three decades of data integration - All problems solved |
108
click to vote
ISCC
2009
IEEE
15 years 10 months ago
2009
IEEE
A problem in large and dynamic networks consists in making available at each node global information about the state of the network. Gossip-based aggregation schemes are a simple ...
114
Voted
ISCAS
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper, the Simulated Evolution algorithm (SimE) is engineered to solve the optimization problem of multi-objective VLSI netlist bi-partitioning. The multi-objective versio...
TIT
2008
15 years 3 months ago
2008
Abstract-- We study coding schemes which encode unconstrained sequences into run-length-limited (d, k)-constrained sequences. We present a general framework for the construction of...
160
click to vote
SIGMOD
2001
ACM
16 years 3 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
132
Voted
IPPS
2008
IEEE
15 years 10 months ago
2008
IEEE
Adaptive replication of data items on servers of a mobile ad hoc network can alleviate access delays. The selection of data items and servers requires solving a constrained optimi...