Sciweavers

4451 search results - page 430 / 891
» On Random Ordering Constraints
Sort
View
COLING
1996
15 years 8 months ago
Learning Dependencies between Case Frame Slots
We address the problem of automatically acquiring case frame patterns (selectional patterns) from large corpus data. In particular, we l)ropose a method of learning dependencies b...
Hang Li, Naoki Abe
CORR
2008
Springer
64views Education» more  CORR 2008»
15 years 7 months ago
Linearly Parameterized Bandits
We consider bandit problems involving a large (possibly infinite) collection of arms, in which the expected reward of each arm is a linear function of an r-dimensional random vect...
Paat Rusmevichientong, John N. Tsitsiklis
JDCTA
2008
88views more  JDCTA 2008»
15 years 6 months ago
A Key Distribution method for Reducing Storage and Supporting High Level Security in the Large-scale WSN
In WSNs, since the attacks, such as jamming or eavesdropping without physical access, easily occur, security is one of the important requirements for WSNs. The key pre-distributio...
Yoon-Su Jeong, Yong-Tae Kim, Gil-Cheol Park, Sang ...
TDSC
2008
121views more  TDSC 2008»
15 years 6 months ago
Multipath Key Establishment for Wireless Sensor Networks Using Just-Enough Redundancy Transmission
In random key predistribution techniques for wireless sensor networks, a relatively small number of keys are randomly chosen from a large key pool and are loaded on the sensors pri...
Jing Deng, Yunghsiang S. Han
TEC
2008
165views more  TEC 2008»
15 years 6 months ago
Population-Based Incremental Learning With Associative Memory for Dynamic Environments
In recent years, interest in studying evolutionary algorithms (EAs) for dynamic optimization problems (DOPs) has grown due to its importance in real-world applications. Several app...
Shengxiang Yang, Xin Yao