5948 search results - page 1000 / 1190 » Computing Robust Counter-Strategies |
111
Voted
ICDM
2008
IEEE
15 years 10 months ago
2008
IEEE
Order-preserving submatrices (OPSM’s) have been shown useful in capturing concurrent patterns in data when the relative magnitudes of data items are more important than their ab...
111
Voted
ICDM
2008
IEEE
15 years 10 months ago
2008
IEEE
In a typical realistic scenario, there exist some past data about the structure of the network which are analyzed with respect to some possibly future spreading process, such as b...
133
Voted
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
Average consensus and gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms for distributed information proc...
159
Voted
ISMAR
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper we present two techniques for natural feature tracking in real-time on mobile phones. We achieve interactive frame rates of up to 20Hz for natural feature tracking f...
127
Voted
ISORC
2008
IEEE
15 years 10 months ago
2008
IEEE
Recent years have witnessed the emergence and rapid growth of distributed service infrastructures such as mobile ad hoc networks, P2P, PlanetLab and Grids. In such distributed inf...