Sciweavers

654 search results - page 57 / 131
» On the Approximation of Computing Evolutionary Trees
Sort
View
EACL
2006
ACL Anthology
14 years 11 months ago
Online Learning of Approximate Dependency Parsing Algorithms
In this paper we extend the maximum spanning tree (MST) dependency parsing framework of McDonald et al. (2005c) to incorporate higher-order feature representations and allow depen...
Ryan T. McDonald, Fernando C. N. Pereira
IPL
2002
118views more  IPL 2002»
14 years 9 months ago
Lower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...
PVLDB
2010
200views more  PVLDB 2010»
14 years 8 months ago
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
Shijie Zhang, Jiong Yang, Wei Jin
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
15 years 4 months ago
Approximating geometric crossover in semantic space
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
Krzysztof Krawiec, Pawel Lichocki
VC
2008
138views more  VC 2008»
14 years 9 months ago
A GPU-based light hierarchy for real-time approximate illumination
Illumination rendering including environment lighting, indirect illumination, and subsurface scattering plays for many graphics applications such as games and VR systems. However, ...
Hyunwoo Ki, Kyoungsu Oh