Sciweavers

2663 search results - page 269 / 533
» How to Choose a Timing Model
Sort
View
AIR
2006
124views more  AIR 2006»
15 years 4 months ago
Expressiveness of temporal query languages: on the modelling of intervals, interval relationships and states
Abstract Storing and retrieving time-related information are important, or even critical, tasks on many areas of Computer Science (CS) and in particular for Artificial Intelligence...
Rodolfo Sabás Gómez, Juan Carlos Aug...
CHI
2006
ACM
16 years 4 months ago
Interacting with communication appliances: an evaluation of two computer vision-based selection techniques
Communication appliances, intended for home settings, require intuitive forms of interaction. Computer vision offers a potential solution, but is not yet sufficiently accurate.As ...
Jacob Eisenstein, Wendy E. Mackay
DCC
2004
IEEE
16 years 3 months ago
An Approximation to the Greedy Algorithm for Differential Compression of Very Large Files
We present a new differential compression algorithm that combines the hash value techniques and suffix array techniques of previous work. Differential compression refers to encodi...
Ramesh C. Agarwal, Suchitra Amalapurapu, Shaili Ja...
TCC
2010
Springer
163views Cryptology» more  TCC 2010»
15 years 11 months ago
Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
Introduced by Micali, Rabin and Kilian (MRK), the basic primitive of zero-knowledge sets (ZKS) allows a prover to commit to a secret set S so as to be able to prove statements such...
Benoît Libert, Moti Yung
ICPR
2008
IEEE
15 years 10 months ago
Clustering by evidence accumulation on affinity propagation
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
Xuqing Zhang, Fei Wu, Yueting Zhuang