Sciweavers

2009 search results - page 172 / 402
» Dense Interest Points
Sort
View
POPL
2007
ACM
14 years 10 months ago
Program verification as probabilistic inference
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Sumit Gulwani, Nebojsa Jojic
ICPP
2009
IEEE
14 years 4 months ago
Run to Potential: Sweep Coverage in Wireless Sensor Networks
—Wireless sensor networks have become a promising technology in monitoring physical world. In many applications with wireless sensor networks, it is essential to understand how w...
Min Xi, Kui Wu, Yong Qi, Jizhong Zhao, Yunhao Liu,...
SSDBM
2003
IEEE
105views Database» more  SSDBM 2003»
14 years 2 months ago
Using Bitmap Index for Interactive Exploration of Large Datasets
Many scientific applications generate large spatiotemporal datasets. A common way of exploring these datasets is to identify and track regions of interest. Usually these regions ...
Kesheng Wu, Wendy S. Koegler, Jacqueline Chen, Ari...
CHES
2006
Springer
81views Cryptology» more  CHES 2006»
14 years 1 months ago
Template Attacks in Principal Subspaces
Side-channel attacks are a serious threat to implementations of cryptographic algorithms. Secret information is recovered based on power consumption, electromagnetic emanations or ...
Cédric Archambeau, Eric Peeters, Fran&ccedi...
CORR
2010
Springer
178views Education» more  CORR 2010»
13 years 8 months ago
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
Daniel Dadush, Chris Peikert, Santosh Vempala