1431 search results - page 39 / 287 » The complexity of random ordered structures |
111
click to vote
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
We consider (uniform) reductions from computing a function f to the task of distinguishing the output of some pseudorandom generator G from uniform. Impagliazzo and Wigderson [IW]...
99
Voted
TARK
2005
Springer
15 years 8 months ago
2005
Springer
Fagin, Halpern, Moses, and Vardi have proposed a framework of epistemic agents with multiple “frames of mind” (local-reasoning structures), to solve problems concerning incons...
129
Voted
IJRR
2007
15 years 2 months ago
2007
Learning patterns of human behavior from sensor data is extremely important for high-level activity inference. We show how to extract a person’s activities and significant plac...
89
Voted
SIGSOFT
2007
ACM
16 years 3 months ago
2007
ACM
We improve on previous recommender systems by taking advantage of the layered structure of software. We use a random-walk approach, mimicking the more focused behavior of a develo...
162
Voted
ICDM
2006
IEEE
15 years 8 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...