Sciweavers

315 search results - page 57 / 63
» Algebraic Lower Bounds for Computing on Encrypted Data
Sort
View
SAC
2008
ACM
14 years 9 months ago
Removing useless variables in cost analysis of Java bytecode
Automatic cost analysis has interesting applications in the context of verification and certification of mobile code. For instance, the code receiver can use cost information in o...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...
FOCS
2004
IEEE
15 years 1 months ago
On the Streaming Model Augmented with a Sorting Primitive
The need to deal with massive data sets in many practical applications has led to a growing interest in computational models appropriate for large inputs. The most important quali...
Gagan Aggarwal, Mayur Datar, Sridhar Rajagopalan, ...
176
Voted
ICDE
2006
IEEE
160views Database» more  ICDE 2006»
15 years 10 months ago
Surface k-NN Query Processing
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
Ke Deng, Xiaofang Zhou, Heng Tao Shen, Kai Xu 0003...
BMCBI
2010
154views more  BMCBI 2010»
14 years 9 months ago
An algorithm for automated closure during assembly
Background: Finishing is the process of improving the quality and utility of draft genome sequences generated by shotgun sequencing and computational assembly. Finishing can invol...
Sergey Koren, Jason R. Miller, Brian Walenz, Grang...
76
Voted
IJVR
2008
106views more  IJVR 2008»
14 years 9 months ago
Improved View Frustum Culling Technique for Real-Time Virtual Heritage Application
Real-time virtual heritage application is normally executed with a high performance computer system. This is due to the complexity and highly computational cost which makes such sy...
Mohd Shahrizal Sunar, Abdullah Mohd Zin, Tengku M....