Sciweavers

3894 search results - page 774 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
ATAL
2003
Springer
13 years 12 months ago
Risk-averse auction agents
Auctions are an important means for purchasing material in the era of e-commerce. Research on auctions often studies them in isolation. In practice, however, auction agents are pa...
Yaxin Liu, Richard Goodwin, Sven Koenig
FOCS
1999
IEEE
13 years 11 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
SIGGRAPH
1993
ACM
13 years 10 months ago
Wavelet radiosity
Radiosity methods have been shown to be an effective means to solve the global illumination problem in Lambertian diffuse environments. These methods approximate the radiosity int...
Steven J. Gortler, Peter Schröder, Michael F....
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
13 years 10 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
CCS
2006
ACM
13 years 10 months ago
Secure function evaluation with ordered binary decision diagrams
Privacy-preserving protocols allow multiple parties with private inputs to perform joint computation while preserving the privacy of their respective inputs. An important cryptogr...
Louis Kruger, Somesh Jha, Eu-Jin Goh, Dan Boneh