Sciweavers

661 search results - page 31 / 133
» Combining Information using Hard Constraints
Sort
View
79
Voted
SECON
2007
IEEE
15 years 4 months ago
Two-hop Relaying in Random Networks with Limited Channel State Information
— In this paper we study two-hop cooperative diversity relaying in random wireless networks. In contrast to most work on cooperative diversity relaying where the relay node posit...
Furuzan Atay Onat, Dan Avidor, Sayandev Mukherjee
AAAI
2000
14 years 11 months ago
Asynchronous Search with Aggregations
Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...
Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Falt...
KDD
2002
ACM
157views Data Mining» more  KDD 2002»
15 years 10 months ago
Transforming data to satisfy privacy constraints
Data on individuals and entities are being collected widely. These data can contain information that explicitly identifies the individual (e.g., social security number). Data can ...
Vijay S. Iyengar
91
Voted
CIKM
2007
Springer
15 years 4 months ago
Reusing relational sources for semantic information access
The rapid growth of available data arises the need for more sophisticated techniques for semantic access to information. It has been proved that using conceptual model or ontology...
Lina Lubyte
CORR
2010
Springer
160views Education» more  CORR 2010»
14 years 7 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely