Sciweavers

997 search results - page 171 / 200
» Completely Lazy Learning
Sort
View
NAACL
2010
13 years 7 months ago
An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
Yoav Goldberg, Michael Elhadad
ICMCS
2009
IEEE
153views Multimedia» more  ICMCS 2009»
13 years 7 months ago
Audio-visual privacy protection for video conference
Group video-conferencing systems are routinely used in major corporations, hospitals and universities for meetings, tele-medicine and distance learning among participants from very...
M. Vijay Venkatesh, Jian Zhao, L. Profitt, Sen-Chi...
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 7 months ago
Scheduling with Rate Adaptation under Incomplete Knowledge of Channel/Estimator Statistics
In time-varying wireless networks, the states of the communication channels are subject to random variations, and hence need to be estimated for efficient rate adaptation and sched...
Wenzhuo Ouyang, Sugumar Murugesan, Atilla Eryilmaz...
BWCCA
2010
13 years 4 months ago
Constructivist Approach to Information Security Awareness in the Middle East
Abstract--This paper studies the application of an approach to enhance information security awareness amongst employees within middleeastern companies, in effort to improve informa...
Mohammed Boujettif, Yongge Wang
JMLR
2010
149views more  JMLR 2010»
13 years 4 months ago
Coherent Inference on Optimal Play in Game Trees
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
Philipp Hennig, David H. Stern, Thore Graepel