Sciweavers

2009 search results - page 295 / 402
» Dense Interest Points
Sort
View
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
13 years 11 months ago
K-D Trees Are Better when Cut on the Longest Side
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....
KR
2000
Springer
13 years 11 months ago
Anytime Diagnostic Reasoning using Approximate Boolean Constraint Propagation
In contrast with classical reasoning, where a solution is either correct or incorrect, approximate reasoning tries to compute solutions which are close to the ideal solution, with...
Alan Verberne, Frank van Harmelen, Annette ten Tei...
RELMICS
2000
Springer
13 years 11 months ago
A Decision Method for Duration Calculus
Abstract: The Duration Calculus is an interval logic introduced for designing realtime systems. This calculus is able to capture important real-time problems like the speci cation ...
Nathalie Chetcuti-Sperandio, Luis Fariñas d...
ASPDAC
1995
ACM
104views Hardware» more  ASPDAC 1995»
13 years 11 months ago
Power analysis of a 32-bit embedded microcontroller
A new approach for power analysis of microprocessorshas recently been proposed [1]. The idea is to look at the power consumption in a microprocessor from the point of view of the ...
Vivek Tiwari, Mike Tien-Chien Lee
EUROCRYPT
1997
Springer
13 years 11 months ago
A Secure and Optimally Efficient Multi-Authority Election Scheme
In this paper we present a new multi-authority secret-ballot election scheme that guarantees privacy, universal verifiability, and robustness. It is the first scheme for which the ...
Ronald Cramer, Rosario Gennaro, Berry Schoenmakers