Sciweavers

3038 search results - page 453 / 608
» High-Speed Function Approximation
Sort
View
ICDAR
2011
IEEE
14 years 5 months ago
Three Dimensional Rotation-Free Recognition of Characters
—In this paper, we propose a new method for three dimensional rotation-free recognition of characters in scene. In the proposed method, we employ the Modified Quadratic Discrimi...
Ryo Narita, Wataru Ohyama, Tetsushi Wakabayashi, F...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
16 years 7 months ago
Intrinsic robustness of the price of anarchy
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...
Tim Roughgarden
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
16 years 7 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
PODS
2001
ACM
127views Database» more  PODS 2001»
16 years 6 months ago
Optimal Aggregation Algorithms for Middleware
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...
Ronald Fagin, Amnon Lotem, Moni Naor
PODS
2008
ACM
109views Database» more  PODS 2008»
16 years 6 months ago
Time-decaying aggregates in out-of-order streams
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...
Graham Cormode, Flip Korn, Srikanta Tirthapura