19320 search results - page 207 / 3864 » On the complexity of computing determinants |
173
click to vote
VLDB
2005
ACM
16 years 1 days ago
2005
ACM
When a private relational table is published using views, secrecy or privacy may be violated. This paper uses a formally-defined notion of k-anonymity to measure disclosure by vi...
134
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We study auctions with severe bounds on the communication allowed: each bidder may only transmit t bits of information to the auctioneer. We consider both welfare- and profit-max...
210
click to vote
RANDOM
2001
Springer
15 years 11 months ago
2001
Springer
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨© ¤¥ ¦ §¨ belongs to a certain class of Boolean functions or whether it is far from the...
133
click to vote
SIGGRAPH
2000
ACM
15 years 11 months ago
2000
ACM
We present a method for automatically rendering pen-and-ink illustrations of trees. A given 3-d tree model is illustrated by the tree and a visual representation of the foliage us...
162
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
This paper deals with pipelined queries over services. The execution plan of such queries defines an order in which the services are called. We present the theoretical underpinni...