Sciweavers

2950 search results - page 183 / 590
» Computing with Infinitely Many Processes
Sort
View
ACL
2011
14 years 10 months ago
A Comparison of Loopy Belief Propagation and Dual Decomposition for Integrated CCG Supertagging and Parsing
Via an oracle experiment, we show that the upper bound on accuracy of a CCG parser is significantly lowered when its search space is pruned using a supertagger, though the supert...
Michael Auli, Adam Lopez
HPDC
1999
IEEE
15 years 10 months ago
Remote Application Scheduling on Metacomputing Systems
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...
Heath A. James, Kenneth A. Hawick
SIGCSE
2005
ACM
117views Education» more  SIGCSE 2005»
15 years 12 months ago
Integrating science and research in a HCI design course
Undergraduate computer science students have few opportunities to experience scientific investigation and computer science research. A human-computer interaction (HCI) course can ...
Robert Pastel
CCGRID
2011
IEEE
14 years 10 months ago
Improving Utilization of Infrastructure Clouds
— A key advantage of Infrastructure-as-a-Service (IaaS) clouds is providing users on-demand access to resources. However, to provide on-demand access, cloud providers must either...
Paul Marshall, Kate Keahey, Timothy Freeman
CIS
2005
Springer
15 years 11 months ago
Two Adaptive Matching Learning Algorithms for Independent Component Analysis
Independent component analysis (ICA) has been applied in many fields of signal processing and many ICA learning algorithms have been proposed from different perspectives. However...
Jinwen Ma, Fei Ge, Dengpan Gao