Sciweavers

4843 search results - page 298 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
127
Voted
SCAM
2007
IEEE
15 years 10 months ago
Fast Approximate Matching of Programs for Protecting Libre/Open Source Software by Using Spatial Indexes
To encourage open source/libre software development, it is desirable to have tools that can help to identify open source license violations. This paper describes the implementatio...
Arnoldo José Müller Molina, Takeshi Sh...
SPIRE
2007
Springer
15 years 10 months ago
Approximate String Matching with Lempel-Ziv Compressed Indexes
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
Luís M. S. Russo, Gonzalo Navarro, Arlindo ...
145
Voted
CGI
2006
IEEE
15 years 10 months ago
An Approximate Image-Space Approach for Real-Time Rendering of Deformable Translucent Objects
Although lots of works have been engaged in interactive and realistic rendering of translucent materials, efficient processing for deformable models remains a challenging problem...
Yi Gong, Wei Chen, Long Zhang, Yun Zeng, Qunsheng ...
ADC
2006
Springer
136views Database» more  ADC 2006»
15 years 10 months ago
A multi-step strategy for approximate similarity search in image databases
Many strategies for similarity search in image databases assume a metric and quadratic form-based similarity model where an optimal lower bounding distance function exists for fil...
Paul Wing Hing Kwan, Junbin Gao
ADC
2004
Springer
87views Database» more  ADC 2004»
15 years 9 months ago
On the Computation of Approximations of Database Queries
Reflective Relational Machines were introduced by S. Abiteboul, C. Papadimitriou and V. Vianu in 1994, as variations of Turing machines which are suitable for the computation of ...
Flavio Antonio Ferrarotti, Jose Maria Turull Torre...