Sciweavers

13214 search results - page 2634 / 2643
» Pseudorandomness for network algorithms
Sort
View
TON
2002
114views more  TON 2002»
13 years 7 months ago
Dynamic parallel access to replicated content in the internet
Popular content is frequently replicated in multiple servers or caches in the Internet to offload origin servers and improve end-user experience. However, choosing the best server ...
Pablo Rodriguez, Ernst Biersack
NECO
2007
150views more  NECO 2007»
13 years 7 months ago
Reinforcement Learning, Spike-Time-Dependent Plasticity, and the BCM Rule
Learning agents, whether natural or artificial, must update their internal parameters in order to improve their behavior over time. In reinforcement learning, this plasticity is ...
Dorit Baras, Ron Meir
PAMI
2007
186views more  PAMI 2007»
13 years 7 months ago
Value-Directed Human Behavior Analysis from Video Using Partially Observable Markov Decision Processes
—This paper presents a method for learning decision theoretic models of human behaviors from video data. Our system learns relationships between the movements of a person, the co...
Jesse Hoey, James J. Little
PVLDB
2008
116views more  PVLDB 2008»
13 years 7 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
PVLDB
2008
107views more  PVLDB 2008»
13 years 7 months ago
Finding relevant patterns in bursty sequences
Sequence data is ubiquitous and finding frequent sequences in a large database is one of the most common problems when analyzing sequence data. Unfortunately many sources of seque...
Alexander Lachmann, Mirek Riedewald
« Prev « First page 2634 / 2643 Last » Next »