Sciweavers

807 search results - page 53 / 162
» Space Efficient Algorithms for Ordered Tree Comparison
Sort
View
162
Voted
SI3D
1995
ACM
15 years 7 months ago
Shadow Volume BSP Trees for Computation of Shadows in Dynamic Scenes
This paper presents an algorithm for shadow calculation in dynamic polyhedral scenes illuminated by point light sources. It is based on a modi cation of Shadow Volume Binary Space...
Yiorgos Chrysanthou, Mel Slater
EDBT
2009
ACM
156views Database» more  EDBT 2009»
15 years 7 months ago
Efficient skyline retrieval with arbitrary similarity measures
A skyline query returns a set of objects that are not dominated by other objects. An object is said to dominate another if it is closer to the query than the latter on all factors...
Deepak P, Prasad M. Deshpande, Debapriyo Majumdar,...
ESWA
2008
152views more  ESWA 2008»
15 years 4 months ago
Collaborative recommender systems: Combining effectiveness and efficiency
Recommender systems base their operation on past user ratings over a collection of items, for instance, books, CDs, etc. Collaborative filtering (CF) is a successful recommendatio...
Panagiotis Symeonidis, Alexandros Nanopoulos, Apos...
IJES
2006
72views more  IJES 2006»
15 years 4 months ago
Non-contiguous linear placement for reconfigurable fabrics
: We present efficient solutions for the non-contiguous linear placement of data-paths for reconfigurable fabrics. A strip-based architecture is assumed for the reconfigurable fabr...
Cristinel Ababei, Kia Bazargan
NAACL
2010
15 years 1 months ago
Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...
Carlos Gómez-Rodríguez, Marco Kuhlma...