Sciweavers

304 search results - page 23 / 61
» An Efficient Method for Evaluating Complex Polynomials
Sort
View
ICALP
2009
Springer
14 years 9 months ago
Limits and Applications of Group Algebras for Parameterized Problems
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
Ioannis Koutis, Ryan Williams
EMNLP
2009
13 years 6 months ago
Better Synchronous Binarization for Machine Translation
Binarization of Synchronous Context Free Grammars (SCFG) is essential for achieving polynomial time complexity of decoding for SCFG parsing based machine translation systems. In t...
Tong Xiao, Mu Li, Dongdong Zhang, Jingbo Zhu, Ming...
SI3D
2010
ACM
13 years 9 months ago
Efficient irradiance normal mapping
Irradiance normal mapping is a method to combine two popular techniques, light mapping and normal mapping, and is used in games such as Half-Life 2 or Halo 3. This combination all...
Ralf Habel, Michael Wimmer
ICCAD
2003
IEEE
161views Hardware» more  ICCAD 2003»
14 years 6 months ago
A General S-Domain Hierarchical Network Reduction Algorithm
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...
Sheldon X.-D. Tan
RIVF
2008
13 years 10 months ago
Simple but effective methods for combining kernels in computational biology
Complex biological data generated from various experiments are stored in diverse data types in multiple datasets. By appropriately representing each biological dataset as a kernel ...
Hiroaki Tanabe, Tu Bao Ho, Canh Hao Nguyen, Saori ...