Sciweavers

4403 search results - page 613 / 881
» Galois Theory of Algorithms
Sort
View
MOBIHOC
2008
ACM
16 years 7 months ago
Delegation forwarding
Mobile opportunistic networks are characterized by unpredictable mobility, heterogeneity of contact rates and lack of global information. Successful delivery of messages at low co...
Vijay Erramilli, Mark Crovella, Augustin Chaintrea...
MOBICOM
2006
ACM
16 years 1 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
PODC
2006
ACM
16 years 1 months ago
Self-stabilizing byzantine agreement
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...
Ariel Daliot, Danny Dolev
MIR
2005
ACM
137views Multimedia» more  MIR 2005»
16 years 1 months ago
Similarity space projection for web image search and annotation
Web image search has been explored and developed in academic as well as commercial areas for over a decade. To measure the similarity between Web images and user queries, most of ...
Ying Liu, Tao Qin, Tie-Yan Liu, Lei Zhang, Wei-Yin...
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
16 years 28 days ago
Intransitivity revisited coevolutionary dynamics of numbers games
Relative fitness, or “evaluation by tests” is one of the building blocks of coevolution: the only fitness information available is a comparison with other individuals in a p...
Pablo Funes, Enrique Pujals