Sciweavers

677 search results - page 34 / 136
» Reducing the Space Requirement of LZ-Index
Sort
View
ECCC
2010
98views more  ECCC 2010»
14 years 8 months ago
Verifying Computations with Streaming Interactive Proofs
Applications based on outsourcing computation require guarantees to the data owner that the desired computation has been performed correctly by the service provider. Methods based...
Graham Cormode, Justin Thaler, Ke Yi
ICPR
2004
IEEE
15 years 11 months ago
A Pattern Synthesis Technique with an Efficient Nearest Neighbor Classifier for Binary Pattern Recognition
Important factors affecting the efficiency and performance of the nearest neighbor classifier (NNC) are space, classification time requirements and for high dimensional data, due ...
M. Narasimha Murty, P. Viswanath, Shalabh Bhatnaga...
CP
2005
Springer
15 years 3 months ago
Caching Search States in Permutation Problems
When the search for a solution to a constraint satisfaction problem backtracks, it is not usually worthwhile to remember the assignment that failed, because the same assignment wil...
Barbara M. Smith
EWCBR
2004
Springer
15 years 3 months ago
Exploiting Background Knowledge when Learning Similarity Measures
The definition of similarity measures—one core component of every CBR application—leads to a serious knowledge acquisition problem if domain and application specific requirem...
Thomas Gabel, Armin Stahl
CAV
1994
Springer
111views Hardware» more  CAV 1994»
15 years 1 months ago
Automatic Verification of Timed Circuits
This paper presents a new formalism and a new algorithm for verifying timed circuits. The formalism, called orbital nets, allows hierarchical verification based on abehavioralseman...
Tomas Rokicki, Chris J. Myers