Sciweavers

14642 search results - page 2710 / 2929
» It's Time for a Change
Sort
View
CONEXT
2009
ACM
15 years 7 months ago
The age of impatience: optimal replication schemes for opportunistic networks
: We study mobile P2P content dissemination schemes which leverage the local dedicated caches provided by hand-held devices (e.g., smart-phones, PDAs) and opportunistic contacts be...
Joshua Reich, Augustin Chaintreau
ESORICS
2010
Springer
15 years 7 months ago
Traffic Analysis against Low-Latency Anonymity Networks Using Available Bandwidth Estimation
Abstract. We introduce a novel remotely-mounted attack that can expose the network identity of an anonymous client, hidden service, and anonymizing proxies. To achieve this, we emp...
Sambuddho Chakravarty, Angelos Stavrou, Angelos D....
FSTTCS
2008
Springer
15 years 7 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel
MM
2010
ACM
207views Multimedia» more  MM 2010»
15 years 6 months ago
TalkMiner: a search engine for online lecture video
TalkMiner is a search engine for lecture webcasts. Lecture videos are processed to recover a set of distinct slide images and OCR is used to generate a list of indexable terms fro...
John Adcock, Matthew Cooper, Laurent Denoue, Hamed...
AOR
2007
107views more  AOR 2007»
15 years 6 months ago
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
Juraj Hromkovic, Tobias Mömke, Kathleen Stein...
« Prev « First page 2710 / 2929 Last » Next »