Sciweavers

1518 search results - page 269 / 304
» Exact and Approximate Bandwidth
Sort
View
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
15 years 2 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
73
Voted
INFOVIS
2002
IEEE
15 years 2 months ago
Visualizing Data with Bounded Uncertainty
Visualization is a powerful way to facilitate data analysis, but it is crucial that visualization systems explicitly convey the presence, nature, and degree of uncertainty to user...
Chris Olston, Jock D. Mackinlay
PODS
2000
ACM
179views Database» more  PODS 2000»
15 years 2 months ago
Selectivity Estimation for Boolean Queries
In a variety of applications ranging from optimizing queries on alphanumeric attributes to providing approximate counts of documents containing several query terms, there is an in...
Zhiyuan Chen, Flip Korn, Nick Koudas, S. Muthukris...
PODS
1999
ACM
121views Database» more  PODS 1999»
15 years 2 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...
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
15 years 1 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill