Sciweavers

17390 search results - page 3417 / 3478
» Distributed Data Clustering
Sort
View
RTCSA
2000
IEEE
14 years 27 days ago
Frame packing in real-time communication
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...
Kristian Sandström, Christer Norström, M...
WOSP
2000
ACM
14 years 26 days ago
Expressing meaningful processing requirements among heterogeneous nodes in an active network
Active Network technology envisions deployment of virtual execution environments within network elements, such as switches and routers. As a result, nonhomogeneous processing can ...
Virginie Galtier, Kevin L. Mills, Yannick Carlinet...
CRYPTO
2000
Springer
157views Cryptology» more  CRYPTO 2000»
14 years 26 days ago
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
Private information retrieval (PIR) enables a user to retrieve a data item from a database, replicated among one or more servers, while hiding the identity of the retrieved item. ...
Amos Beimel, Yuval Ishai, Tal Malkin
AINA
2010
IEEE
14 years 26 days ago
A Fully Dynamic and Self-Stabilizing TDMA Scheme for Wireless Ad-hoc Networks
One important challenge in wireless ad hoc networks is to achieve collision free communication. Many MAC layer protocols have been proposed by considering various communication mod...
Bezawada Bruhadeshwar, Kishore Kothapalli, Indira ...
COMPUTE
2010
ACM
14 years 25 days ago
Mining periodic-frequent patterns with maximum items' support constraints
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...
R. Uday Kiran, P. Krishna Reddy
« Prev « First page 3417 / 3478 Last » Next »