Sciweavers

247 search results - page 29 / 50
» Extracting All the Randomness from a Weakly Random Source
Sort
View
TCOM
2011
118views more  TCOM 2011»
13 years 2 months ago
A Joint Network and Channel Coding Strategy for Wireless Decode-and-Forward Relay Networks
—In this paper, we consider a wireless multicast network with multiple sources, relays, and destinations. We adopt a multi-hop decode-and-forward relay protocol such that two can...
Qiang Li, See Ho Ting, Chin Keong Ho
SPAA
2006
ACM
14 years 1 months ago
Playing push vs pull: models and algorithms for disseminating dynamic data in networks
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
R. C. Chakinala, Abishek Kumarasubramanian, Kofi A...
IADIS
2003
13 years 9 months ago
Informatization and E-Business Model Application for Distributed Data Mining Using Mobile Agents
Distributed data mining (DDM) is the semi-automatic pattern extraction of distributed data sources. The next generation of the data mining studies will be distributed data mining ...
Ezendu Ifeanyi Ariwa, Mohamed B. Senousy, Mohamed ...
SIGMOD
2004
ACM
142views Database» more  SIGMOD 2004»
14 years 7 months ago
Understanding Web Query Interfaces: Best-Effort Parsing with Hidden Syntax
Recently, the Web has been rapidly "deepened" by many searchable databases online, where data are hidden behind query forms. For modelling and integrating Web databases,...
Zhen Zhang, Bin He, Kevin Chen-Chuan Chang
FOCS
1998
IEEE
13 years 11 months ago
The Finite Capacity Dial-A-Ride Problem
In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k--the capacity of t...
Moses Charikar, Balaji Raghavachari