Sciweavers

16666 search results - page 2710 / 3334
» Descriptive and Computational Complexity
Sort
View
SIGECOM
2011
ACM
216views ECommerce» more  SIGECOM 2011»
14 years 10 months ago
Strategic sequential voting in multi-issue domains and multiple-election paradoxes
In many settings, a group of agents must come to a joint decision on multiple issues. In practice, this is often done by voting on the issues in sequence. In this paper, we model ...
Lirong Xia, Vincent Conitzer, Jérôme ...
SIGIR
2011
ACM
14 years 10 months ago
Fast context-aware recommendations with factorization machines
The situation in which a choice is made is an important information for recommender systems. Context-aware recommenders take this information into account to make predictions. So ...
Steffen Rendle, Zeno Gantner, Christoph Freudentha...
APPROX
2011
Springer
234views Algorithms» more  APPROX 2011»
14 years 7 months ago
Streaming Algorithms with One-Sided Estimation
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
Joshua Brody, David P. Woodruff
ASPLOS
2012
ACM
14 years 2 months ago
Understanding modern device drivers
Device drivers are the single largest contributor to operating-system kernel code with over 5 million lines of code in the Linux kernel, and cause significant complexity, bugs an...
Asim Kadav, Michael M. Swift
ICA
2012
Springer
14 years 2 months ago
On Revealing Replicating Structures in Multiway Data: A Novel Tensor Decomposition Approach
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
Anh Huy Phan, Andrzej Cichocki, Petr Tichavsk&yacu...
« Prev « First page 2710 / 3334 Last » Next »