Sciweavers

189 search results - page 12 / 38
» Polynomial-time Computation via Local Inference Relations
Sort
View
WINE
2005
Springer
179views Economy» more  WINE 2005»
15 years 3 months ago
A Graph-Theoretic Network Security Game
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...
MOBICOM
2010
ACM
14 years 10 months ago
Inferring and mitigating a link's hindering transmissions in managed 802.11 wireless networks
In 802.11 managed wireless networks, the manager can address under-served links by rate-limiting the conflicting nodes. In order to determine to what extent each conflicting node ...
Eugenio Magistretti, Omer Gurewitz, Edward W. Knig...
ECCV
2004
Springer
15 years 11 months ago
Multiple View Feature Descriptors from Image Sequences via Kernel Principal Component Analysis
Abstract. We present a method for learning feature descriptors using multiple images, motivated by the problems of mobile robot navigation and localization. The technique uses the ...
Jason Meltzer, Ming-Hsuan Yang, Rakesh Gupta, Stef...
CORR
2011
Springer
217views Education» more  CORR 2011»
14 years 1 months ago
Coarse-Grained Topology Estimation via Graph Sampling
Many online networks are measured and studied via sampling techniques, which typically collect a relatively small fraction of nodes and their associated edges. Past work in this a...
Maciej Kurant, Minas Gjoka, Yan Wang, Zack W. Almq...
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
15 years 2 months ago
SNPs Problems, Complexity, and Algorithms
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross...