Sciweavers

1174 search results - page 182 / 235
» Optimizing generics is easy!
Sort
View
SCHOLARPEDIA
2011
13 years 2 months ago
N-body simulations
Abstract. Scientists’ ability to generate and collect massive-scale datasets is increasing. As a result, constraints in data analysis capability rather than limitations in the av...
IACR
2011
136views more  IACR 2011»
12 years 10 months ago
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...
Daniele Micciancio, Chris Peikert
CVPR
2012
IEEE
12 years 1 months ago
A simple prior-free method for non-rigid structure-from-motion factorization
This paper proposes a simple “prior-free” method for solving non-rigid structure-from-motion factorization problems. Other than using the basic low-rank condition, our method ...
Yuchao Dai, Hongdong Li, Mingyi He
SSD
2007
Springer
171views Database» more  SSD 2007»
14 years 5 months ago
Transformation of Continuous Aggregation Join Queries over Data Streams
We address continuously processing an aggregation join query over data streams. Queries of this type involve both join and aggregation operations, with windows specified on join ...
Tri Minh Tran, Byung Suk Lee
BMCBI
2010
116views more  BMCBI 2010»
13 years 11 months ago
A hybrid approach to protein folding problem integrating constraint programming with local search
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
Abu Zafer M. Dayem Ullah, Kathleen Steinhöfel