888 search results - page 150 / 178 » Improving Random Projections Using Marginal Information |
ISPA
2005
Springer
15 years 5 months ago
2005
Springer
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
130
click to vote
TSP
2010
14 years 6 months ago
2010
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
116
click to vote
ELPUB
2008
ACM
15 years 1 months ago
2008
ACM
Being subscribed to a newspaper, readers expect some basic things: receiving their paper in their mailbox early in the morning, being able to read it privately when and where they...
CAISE
2001
Springer
15 years 4 months ago
2001
Springer
Business processes play a central role in the reorganization of a company and the (re)design of the respective information system(s). Typically the processes are described with the...
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
The goal of this work is to find all people in archive films. Challenges include low image quality, motion blur, partial occlusion, non-standard poses and crowded scenes. We base ...