Sciweavers

2526 search results - page 272 / 506
» A New Algorithm for Answer Set Computation
Sort
View
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
15 years 8 months ago
Improved bounds on the sample complexity of learning
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
Yi Li, Philip M. Long, Aravind Srinivasan
CN
2000
108views more  CN 2000»
15 years 6 months ago
A Web marketing system with automatic pricing
: We propose a new scheme of `automatic pricing' for digital contents, and describe an implemented system as well as concrete pricing algorithms for it. Automatic pricing refe...
Naoki Abe, Tomonari Kamba
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
16 years 8 months ago
Navigation- vs. Index-Based XML Multi-Query Processing
XML path queries form the basis of complex filtering of XML data. Most current XML path query processing techniques can be divided in two groups. Navigation-based algorithms compu...
Nicolas Bruno, Luis Gravano, Nick Koudas, Divesh S...
OOPSLA
2005
Springer
16 years 2 days ago
Demand-driven points-to analysis for Java
We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environmen...
Manu Sridharan, Denis Gopan, Lexin Shan, Rastislav...
CTRSA
2009
Springer
141views Cryptology» more  CTRSA 2009»
15 years 10 months ago
Practical Short Signature Batch Verification
In many applications, it is desirable to work with signatures that are both short, and yet where many messages from different signers be verified very quickly. RSA signatures sati...
Anna Lisa Ferrara, Matthew Green, Susan Hohenberge...