Sciweavers

1095 search results - page 129 / 219
» Preprocessing of Intractable Problems
Sort
View
CORR
2006
Springer
154views Education» more  CORR 2006»
13 years 10 months ago
How Hard Is Bribery in Elections?
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by paying certain voters to change t...
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hem...
JAIR
2008
130views more  JAIR 2008»
13 years 10 months ago
Online Planning Algorithms for POMDPs
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
Stéphane Ross, Joelle Pineau, Sébast...
CORR
2007
Springer
122views Education» more  CORR 2007»
13 years 10 months ago
Practical Identity-Based Encryption (IBE) in Multiple PKG Environments and Its Applications
Abstract. Identity-based encryption (IBE) schemes are usually used in multiplePKG environments — on the one hand, each administrative domain (e.g., a relatively small and close o...
Shengbao Wang
MP
2006
87views more  MP 2006»
13 years 10 months ago
Convexity and decomposition of mean-risk stochastic programs
Abstract. Traditional stochastic programming is risk neutral in the sense that it is concerned with the optimization of an expectation criterion. A common approach to addressing ri...
Shabbir Ahmed
TITB
2008
109views more  TITB 2008»
13 years 10 months ago
Automatic Segmentation of High-Throughput RNAi Fluorescent Cellular Images
High throughput genome-wide RNAi screening is emerging as an essential tool to assist biologists in understanding complex cellular processes. The large number of images produced in...
Pingkun Yan, Xiaobo Zhou, Mubarak Shah, Stephen T....