Sciweavers

322 search results - page 32 / 65
» Least Expected Cost Query Optimization: What Can We Expect
Sort
View
ICDE
2008
IEEE
112views Database» more  ICDE 2008»
14 years 10 months ago
XML Index Recommendation with Tight Optimizer Coupling
XML database systems are expected to handle increasingly complex queries over increasingly large and highly structured XML databases. An important problem that needs to be solved ...
Iman Elghandour, Ashraf Aboulnaga, Daniel C. Zilio...
EUROCRYPT
1999
Springer
14 years 28 days ago
An Analysis of Exponentiation Based on Formal Languages
A recoding rule for exponentiation is a method for reducing the cost of the exponentiation ae by reducing the number of required multiplications. If w(e) is the (hamming) weight of...
Luke O'Connor
COMCOM
2008
127views more  COMCOM 2008»
13 years 8 months ago
A dynamic routing protocol for keyword search in unstructured peer-to-peer networks
The idea of building query-oriented routing indices has changed the way of improving keyword search efficiency from the basis as it can learn the content distribution from the que...
Cong Shi, Dingyi Han, Yuanjie Liu, Shicong Meng, Y...
GECCO
2005
Springer
100views Optimization» more  GECCO 2005»
14 years 2 months ago
The MaxSolve algorithm for coevolution
Coevolution can be used to adaptively choose the tests used for evaluating candidate solutions. A long-standing question is how this dynamic setup may be organized to yield reliab...
Edwin D. de Jong
ECCV
2010
Springer
13 years 9 months ago
A Data-Driven Approach for Event Prediction
When given a single static picture, humans can not only interpret the instantaneous content captured by the image, but also they are able to infer the chain of dynamic events that ...
Jenny Yuen, Antonio Torralba