Sciweavers

34 search results - page 3 / 7
» Implicit Factoring: On Polynomial Time Factoring Given Only ...
Sort
View
ICDM
2010
IEEE
172views Data Mining» more  ICDM 2010»
13 years 5 months ago
Learning Attribute-to-Feature Mappings for Cold-Start Recommendations
Cold-start scenarios in recommender systems are situations in which no prior events, like ratings or clicks, are known for certain users or items. To compute predictions in such ca...
Zeno Gantner, Lucas Drumond, Christoph Freudenthal...
COCO
2010
Springer
153views Algorithms» more  COCO 2010»
13 years 11 months ago
Communication Complexity with Synchronized Clocks
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
Russell Impagliazzo, Ryan Williams
ICASSP
2008
IEEE
14 years 1 months ago
Reconstructing sparse signals from their zero crossings
Classical sampling records the signal level at pre-determined time instances, usually uniformly spaced. An alternative implicit sampling model is to record the timing of pre-deter...
Petros Boufounos, Richard G. Baraniuk
MST
2007
167views more  MST 2007»
13 years 6 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
CGF
1999
86views more  CGF 1999»
13 years 7 months ago
Generalized View-Dependent Simplification
We propose a technique for performing view-dependent geometry and topology simplifications for level-of-detailbased renderings of large models. The algorithm proceeds by preproces...
Jihad El-Sana, Amitabh Varshney