28888 search results - page 5600 / 5778 » Computability and complexity in analysis |
135
click to vote
SDM
2008
SIAM
15 years 4 months ago
2008
SIAM
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
138
click to vote
TREC
2008
15 years 4 months ago
2008
In the TREC 2008, the team from the State University of New York at Buffalo participated in the Legal track and the Blog track. For the Legal track, we worked on the interactive s...
127
click to vote
RIVF
2007
15 years 4 months ago
2007
— This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in Quantum Key Distribution (QKD)-based networks. We develop a realistic QKDbase...
158
click to vote
UAI
2008
15 years 4 months ago
2008
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
119
Voted
AAAI
2004
15 years 4 months ago
2004
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...