Sciweavers

372 search results - page 47 / 75
» On Finding Small 2-Generating Sets
Sort
View
KDD
1999
ACM
108views Data Mining» more  KDD 1999»
14 years 1 months ago
Mining the Most Interesting Rules
Several algorithms have been proposed for finding the “best,” “optimal,” or “most interesting” rule(s) in a database according to a variety of metrics including confid...
Roberto J. Bayardo Jr., Rakesh Agrawal
OOPSLA
1998
Springer
14 years 1 months ago
JRes: A Resource Accounting Interface for Java
With the spread of the Internet the computing model on server systems is undergoing several important changes. Recent research ideas concerning dynamic operating system extensibil...
Grzegorz Czajkowski, Thorsten von Eicken
VLDB
1998
ACM
105views Database» more  VLDB 1998»
14 years 1 months ago
Computing Iceberg Queries Efficiently
Many applications compute aggregate functions over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg querie...
Min Fang, Narayanan Shivakumar, Hector Garcia-Moli...
HT
2007
ACM
14 years 1 months ago
Annotation consensus: implications for passage recommendation in scientific literature
We present a study of the degree to which annotations overlap when several researchers read the same set of scientific articles. Our objective is to determine whether there is suf...
Shannon Bradshaw, Marc Light
ATAL
2006
Springer
14 years 1 months ago
Sequences of take-it-or-leave-it offers: near-optimal auctions without full valuation revelation
Abstract. We introduce take-it-or-leave-it auctions (TLAs) as an allocation mechanism that allows buyers to retain much of their private valuation information, yet generates close-...
Tuomas Sandholm, Andrew Gilpin