Sciweavers

5326 search results - page 403 / 1066
» On what we can ensure
Sort
View
FTNET
2007
107views more  FTNET 2007»
15 years 6 months ago
Network Optimization and Control
We study how protocol design for various functionalities within a communication network architecture can be viewed as a distributed resource allocation problem. This involves unde...
Srinivas Shakkottai, R. Srikant
SIAMCOMP
1998
111views more  SIAMCOMP 1998»
15 years 6 months ago
Computing the Local Consensus of Trees
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
Sampath Kannan, Tandy Warnow
CVPR
2010
IEEE
16 years 3 months ago
Beyond Active Noun Tagging: Modeling Contextual Interactions for Multi-Class Active Learning
We present an active learning framework to simultaneously learn appearance and contextual models for scene understanding tasks (multi-class classification). Existing multi-class a...
Behjat Siddiquie, Abhinav Gupta
CRYPTO
2003
Springer
132views Cryptology» more  CRYPTO 2003»
16 years 1 days ago
On Cryptographic Assumptions and Challenges
We deal with computational assumptions needed in order to design secure cryptographic schemes. We suggest a classi£cation of such assumptions based on the complexity of falsifying...
Moni Naor
WDAG
2009
Springer
160views Algorithms» more  WDAG 2009»
15 years 11 months ago
Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems
This paper defines the basic notions of local and non-local tasks, and determines the minimum information about failures that is necessary to solve any non-local task in message-p...
Carole Delporte-Gallet, Hugues Fauconnier, Sam Tou...