Sciweavers

3146 search results - page 222 / 630
» Efficient Consequence Finding
Sort
View
VLSID
2008
IEEE
128views VLSI» more  VLSID 2008»
16 years 7 months ago
A Novel Approach to Compute Spatial Reuse in the Design of Custom Instructions
In the automatic design of custom instruction set processors, there can be a very large set of potential custom instructions, from which a few instructions are required to be chos...
Nagaraju Pothineni, Anshul Kumar, Kolin Paul
EDBT
2008
ACM
125views Database» more  EDBT 2008»
16 years 6 months ago
On the brink: searching for drops in sensor data
Sensor networks have been widely used to collect data about the environment. When analyzing data from these systems, people tend to ask exploratory questions--they want to find su...
Gong Chen, Junghoo Cho, Mark H. Hansen
CVPR
2010
IEEE
16 years 3 months ago
Pareto-optimal Dictionaries for Signatures
We present an effective method to optimize over the parameters of an image patch descriptor to obtain one that is computationally more efficient while maintaining a high recogniti...
Michael Calonder, Vincent Lepetit, Pascal Fua
ICDE
2010
IEEE
184views Database» more  ICDE 2010»
15 years 11 months ago
On optimal anonymization for l+-diversity
-- Publishing person specific data while protecting privacy is an important problem. Existing algorithms that enforce the privacy principle called l-diversity are heuristic based d...
Junqiang Liu, Ke Wang
FSE
2008
Springer
91views Cryptology» more  FSE 2008»
15 years 8 months ago
SWIFFT: A Modest Proposal for FFT Hashing
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...
Vadim Lyubashevsky, Daniele Micciancio, Chris Peik...