Sciweavers

736 search results - page 74 / 148
» High-order functions and their ordering relations
Sort
View
PODS
1999
ACM
121views Database» more  PODS 1999»
15 years 4 months ago
Tracking Join and Self-Join Sizes in Limited Storage
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
Noga Alon, Phillip B. Gibbons, Yossi Matias, Mario...
TSMC
2010
14 years 6 months ago
A Mobile Decision Support System for Dynamic Group Decision-Making Problems
Abstract--The aim of this paper is to present a decision support system model with two important characteristic: 1) mobile technologies are applied in the decision process and 2) t...
Ignacio Javier Pérez, Francisco Javier Cabr...
PODS
2006
ACM
104views Database» more  PODS 2006»
16 years 4 hour ago
Tractable database design through bounded treewidth
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
Georg Gottlob, Reinhard Pichler, Fang Wei
FUN
2010
Springer
254views Algorithms» more  FUN 2010»
15 years 4 months ago
Christmas Gift Exchange Games
The Christmas gift exchange is a popular party game played around Christmas. Each participant brings a Christmas present to the party, and a random ordering of the participants, ac...
Arpita Ghosh, Mohammad Mahdian
IJCAI
2007
15 years 1 months ago
Incompleteness and Incomparability in Preference Aggregation
We consider how to combine the preferences of multiple agents despite the presence of incompleteness and incomparability in their preference orderings. An agent’s preference orde...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...