Sciweavers

2100 search results - page 254 / 420
» Fundamentals of the problem
Sort
View
SDM
2012
SIAM
304views Data Mining» more  SDM 2012»
13 years 8 months ago
Robust Reputation-Based Ranking on Bipartite Rating Networks
With the growth of the Internet and E-commerce, bipartite rating networks are ubiquitous. In such bipartite rating networks, there exist two types of entities: the users and the o...
Rong-Hua Li, Jeffrey Xu Yu, Xin Huang, Hong Cheng
WISEC
2009
ACM
16 years 13 days ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...
SOFSEM
2000
Springer
15 years 9 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
AAAI
1997
15 years 7 months ago
Model Minimization in Markov Decision Processes
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...
Thomas Dean, Robert Givan
CORR
2002
Springer
102views Education» more  CORR 2002»
15 years 5 months ago
Quantum Lower Bound for Recursive Fourier Sampling
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
Scott Aaronson