Sciweavers

953 search results - page 4 / 191
» Efficient Evaluation of Large Polynomials
Sort
View
IJDAR
2002
116views more  IJDAR 2002»
13 years 7 months ago
Performance evaluation of pattern classifiers for handwritten character recognition
Abstract. This paper describes a performance evaluation study in which some efficient classifiers are tested in handwritten digit recognition. The evaluated classifiers include a s...
Cheng-Lin Liu, Hiroshi Sako, Hiromichi Fujisawa
FPL
2003
Springer
113views Hardware» more  FPL 2003»
14 years 28 days ago
Non-uniform Segmentation for Hardware Function Evaluation
This paper presents a method for evaluating functions in hardware based on polynomial approximation with non-uniform segments. The novel use of nonuniform segments enables us to ap...
Dong-U Lee, Wayne Luk, John D. Villasenor, Peter Y...
AISC
2008
Springer
13 years 9 months ago
Search Techniques for Rational Polynomial Orders
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto,...
CCS
2008
ACM
13 years 9 months ago
Assessing query privileges via safe and efficient permission composition
We propose an approach for the selective enforcement of access control restrictions in, possibly distributed, large data collections based on two basic concepts: i) flexible autho...
Sabrina De Capitani di Vimercati, Sara Foresti, Su...
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 7 months ago
Generating Random Graphs with Large Girth
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...
Mohsen Bayati, Andrea Montanari, Amin Saberi