Sciweavers

612 search results - page 118 / 123
» Using Data Compressors to Construct Rank Tests
Sort
View
CGO
2010
IEEE
15 years 5 months ago
Linear scan register allocation on SSA form
The linear scan algorithm for register allocation provides a good register assignment with a low compilation overhead and is thus frequently used for just-in-time compilers. Altho...
Christian Wimmer, Michael Franz
CGF
2006
173views more  CGF 2006»
14 years 10 months ago
C-BDAM - Compressed Batched Dynamic Adaptive Meshes for Terrain Rendering
We describe a compressed multiresolution representation for supporting interactive rendering of very large planar and spherical terrain surfaces. The technique, called Compressed ...
Enrico Gobbetti, Fabio Marton, Paolo Cignoni, Marc...
BMCBI
2006
184views more  BMCBI 2006»
14 years 10 months ago
PathSys: integrating molecular interaction graphs for systems biology
Background: The goal of information integration in systems biology is to combine information from a number of databases and data sets, which are obtained from both high and low th...
Michael Baitaluk, Xufei Qian, Shubhada Godbole, Al...
TIFS
2008
157views more  TIFS 2008»
14 years 10 months ago
Subspace Approximation of Face Recognition Algorithms: An Empirical Study
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
Pranab Mohanty, Sudeep Sarkar, Rangachar Kasturi, ...
CIKM
2006
Springer
15 years 1 months ago
Coupling feature selection and machine learning methods for navigational query identification
It is important yet hard to identify navigational queries in Web search due to a lack of sufficient information in Web queries, which are typically very short. In this paper we st...
Yumao Lu, Fuchun Peng, Xin Li, Nawaaz Ahmed