Sciweavers

2111 search results - page 243 / 423
» Understanding the Yarowsky Algorithm
Sort
View
NETWORKING
2007
15 years 8 months ago
Characterizing the Capacity Gain of Stream Control Scheduling in MIMO Wireless Mesh Networks
Stream control has recently attracted attentions in the research of MIMO wireless networks as a potential way to improve network capacity. However, inappropriate use of stream cont...
Yue Wang, Dah-Ming Chiu, John C. S. Lui
NIPS
2007
15 years 8 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong
CLIN
2004
15 years 8 months ago
Trailfinder - A Case Study in Extracting Spatial Information Using Deep Language Processing
The present paper reports on an end-to-end application using a deep processing grammar to extract spatial and temporal information of prepositional and adverbial expressions from ...
Lars Hellan, Dorothee Beermann, Jon Atle Gulla, At...
DMIN
2006
144views Data Mining» more  DMIN 2006»
15 years 8 months ago
Discovering Assignment Rules in Workforce Schedules Using Data Mining
Discovering hidden patterns in large sets of workforce schedules to gain insight into the potential knowledge in workforce schedules are crucial to better understanding the workfor...
Jihong Yan
ALENEX
2001
105views Algorithms» more  ALENEX 2001»
15 years 8 months ago
A Probabilistic Spell for the Curse of Dimensionality
Range searches in metric spaces can be very di cult if the space is \high dimensional", i.e. when the histogram of distances has a large mean and a small variance. The so-cal...
Edgar Chávez, Gonzalo Navarro