Sciweavers

879 search results - page 67 / 176
» Greedy Attribute Selection
Sort
View
WAOA
2005
Springer
152views Algorithms» more  WAOA 2005»
15 years 9 months ago
Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost
We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that comput...
Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. ...
VLDB
1994
ACM
114views Database» more  VLDB 1994»
15 years 8 months ago
Including Group-By in Query Optimization
In existing relational database systems, processing of group-by and computation of aggregate functions are always postponed until all joins are performed. In this paper, we presen...
Surajit Chaudhuri, Kyuseok Shim
123
Voted
CLEF
2006
Springer
15 years 7 months ago
A High Precision Information Retrieval Method for WiQA
This paper presents Wolverhampton University's participation in the WiQA competition. The method chosen for this task combines a high precision, but low recall information re...
Constantin Orasan, Georgiana Puscasu
AAAI
2006
15 years 5 months ago
Anytime Induction of Decision Trees: An Iterative Improvement Approach
Most existing decision tree inducers are very fast due to their greedy approach. In many real-life applications, however, we are willing to allocate more time to get better decisi...
Saher Esmeir, Shaul Markovitch
SBBD
2003
101views Database» more  SBBD 2003»
15 years 5 months ago
Cherry Picking: A Semantic Query Processing Strategy for the Evaluation of Expensive Predicates
A common requirement of many scientific applications is the ability to process queries involving expensive predicates corresponding to user programs. Optimizing such queries is ha...
Fabio Porto, Eduardo Sany Laber, Patrick Valduriez