Sciweavers

6943 search results - page 1328 / 1389
» Representations for evolutionary algorithms
Sort
View
LREC
2010
180views Education» more  LREC 2010»
15 years 5 months ago
Parsing to Stanford Dependencies: Trade-offs between Speed and Accuracy
We investigate a number of approaches to generating Stanford Dependencies, a widely used semantically-oriented dependency representation. We examine algorithms specifically design...
Daniel Cer, Marie-Catherine de Marneffe, Daniel Ju...
GRAPHICSINTERFACE
2008
15 years 5 months ago
Quality scalability of soft shadow mapping
Recently, several soft shadow mapping algorithms have been introduced which extract micro-occluders from a shadow map and backproject them on the light source to approximately det...
Michael Schwarz, Marc Stamminger
DGO
2006
134views Education» more  DGO 2006»
15 years 5 months ago
Next steps in near-duplicate detection for eRulemaking
Large volume public comment campaigns and web portals that encourage the public to customize form letters produce many near-duplicate documents, which increases processing and sto...
Hui Yang, Jamie Callan, Stuart W. Shulman
DLOG
2006
15 years 5 months ago
Tableau Caching for Description Logics with Inverse and Transitive Roles
Abstract. Modern description logic (DL) reasoners are known to be less efficient for DLs with inverse roles. The current loss of performance is largely due to the missing applicabi...
Yu Ding, Volker Haarslev
VMV
2004
185views Visualization» more  VMV 2004»
15 years 5 months ago
Convexification of Unstructured Grids
Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For conca...
Stefan Röttger, Stefan Guthe, Andreas Schiebe...
« Prev « First page 1328 / 1389 Last » Next »