Sciweavers

2168 search results - page 24 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
ACL
2010
13 years 5 months ago
Using Smaller Constituents Rather Than Sentences in Active Learning for Japanese Dependency Parsing
We investigate active learning methods for Japanese dependency parsing. We propose active learning methods of using partial dependency relations in a given sentence for parsing an...
Manabu Sassano, Sadao Kurohashi
CIMCA
2008
IEEE
14 years 2 months ago
LGR: The New Genetic Based Scheduler for Grid Computing Systems
—The computational grid provides a promising platform for the deployment of various high-performance computing applications. In computational grid, an efficient scheduling of tas...
Leili Mohammad Khanli, Seyad Naser Razavi, Nima Ja...
ECOOP
2009
Springer
14 years 8 months ago
Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis
Pointer analyses derived from a Context-Free-Language (CFL) reachability formulation achieve very high precision, but they do not scale well to compute the points-to solution for a...
Guoqing Xu, Atanas Rountev, Manu Sridharan
WSCG
2003
177views more  WSCG 2003»
13 years 9 months ago
Efficient NURBS Rendering using View-Dependent LOD and Normal Maps
Rendering large trimmed NURBS models with high quality at interactive frame rates is of great interest for industry, since nearly all their models are designed on the basis of thi...
Michael Guthe, Reinhard Klein
NIPS
2008
13 years 9 months ago
Reducing statistical dependencies in natural signals using radial Gaussianization
We consider the problem of transforming a signal to a representation in which the components are statistically independent. When the signal is generated as a linear transformation...
Siwei Lyu, Eero P. Simoncelli