Sciweavers

35419 search results - page 180 / 7084
» How are we doing
Sort
View
P2P
2007
IEEE
104views Communications» more  P2P 2007»
15 years 10 months ago
How stable are large superpeer networks against attack?
In this paper, we analyze the stability of large scale superpeer networks against attacks. Two different kinds of attacks namely deterministic and degree dependent attack have bee...
Bivas Mitra, Sujoy Ghose, Niloy Ganguly
131
Voted
FOCS
2006
IEEE
15 years 10 months ago
How to Play Unique Games Using Embeddings
In this paper we present a new approximation algorithm for Unique Games. For a Unique Game with n vertices and k states (labels), if a (1 − ε) fraction of all constraints is sa...
Eden Chlamtac, Konstantin Makarychev, Yury Makaryc...
GW
2005
Springer
173views Biometrics» more  GW 2005»
15 years 9 months ago
Deixis: How to Determine Demonstrated Objects Using a Pointing Cone
Abstract. We present an collaborative approach towards a detailed understanding of the usage of pointing gestures accompanying referring expressions. This effort is undertaken in t...
Alfred Kranstedt, Andy Lücking, Thies Pfeiffe...
ISW
2004
Springer
15 years 9 months ago
How to Break and Repair a Universally Composable Signature Functionality
Abstract. Canetti and Rabin recently proposed a universally composable ideal functionality FSIG for digital signatures. We show that this functionality cannot be securely realized ...
Michael Backes, Dennis Hofheinz
ECCV
2010
Springer
15 years 9 months ago
Learning What and How of Contextual Models for Scene Labeling
We present a data-driven approach to predict the importance of edges and construct a Markov network for image analysis based on statistical models of global and local image feature...