Sciweavers

1381 search results - page 139 / 277
» Computational Complexity of Constraint Satisfaction
Sort
View
WCNC
2010
IEEE
15 years 2 months ago
On MIMO Cognitive Radios with Antenna Selection
—With the ever increasing interest in multiple-input multiple-output (MIMO) cognitive radio (CR) systems, reducing the costs associated with RF-chains at the radio front end beco...
Muhammad Fainan Hanif, Peter J. Smith
CHI
2009
ACM
16 years 4 months ago
Aesthetics matter: leveraging design heuristics to synthesize visually satisfying handheld interfaces
We present a tool for automatically generating UI layouts for handheld devices based on design principles. This tool introduces a gestalt approach to visual interface design rathe...
Yeonsoo Yang, Scott R. Klemmer
FOCS
2008
IEEE
15 years 10 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
FOCS
2007
IEEE
15 years 10 months ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák
PUC
2007
154views more  PUC 2007»
15 years 3 months ago
Point-of-capture archiving and editing of personal experiences from a mobile device
Personal experience computing is an emerging research area in computing support for capturing, archiving, editing, and utilizing of digital personal experiences. This paper presen...
Chon-in Wu, Chao-ming Teng, Yi-Chao Chen, Tung-yun...