923 search results - page 75 / 185 » Factorizing Languages |
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We consider the problem of designing truthful auctions, when the bidders' valuations have a public and a private component. In particular, we consider combinatorial auctions w...
WWW
2004
ACM
16 years 17 days ago
2004
ACM
Metadata development can be challenging because the vocabulary should be flexible and extensible, widely applicable, interoperable, and both machine and human readable. We describ...
147
click to vote
SIGMOD
2007
ACM
16 years 1 days ago
2007
ACM
We demonstrate a novel query interface that enables users to construct a rich search query without any prior knowledge of the underlying schema or data. The interface, which is in...
W4A
2006
ACM
15 years 5 months ago
2006
ACM
Interest in accessing the Web from small, mobile devices, such as cell phones, is increasing rapidly. The challenge of delivering content to such devices is similar in many ways t...
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...