653 search results - page 88 / 131 » The size of minimum 3-trees |
RTCSA
2000
IEEE
15 years 4 months ago
2000
IEEE
A common computational model in distributed embedded systems is that the nodes exchange signals via a network. Most often a signal represents the state of some physical device and...
116
click to vote
OPODIS
2004
15 years 1 months ago
2004
S (in alphabetic order by speaker surname) Speaker: Uri Abraham (Ben-Gurion University) Title: Self-Stabilizing TimeStamps : Speaker: Anish Arora (Ohio State) Title: Self-Stabilizi...
233
click to vote
Publication
Future broadband satellite networks will support a variety of service types. Many such systems are being designed with ATM or ATM like technology. A majority of Internet applicatio...
232
click to vote
ICDE
1995
IEEE
16 years 1 months ago
1995
IEEE
Abstract. The problem of mining sequential patterns was recently introduced in 3 . We are given a database of sequences, where each sequence is a list of transactions ordered by tr...
STOC
2009
ACM
16 years 14 days ago
2009
ACM
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...