Sciweavers

291 search results - page 27 / 59
» How Well Can Primal-Dual and Local-Ratio Algorithms Perform
Sort
View
IPSN
2009
Springer
15 years 8 months ago
Near-optimal Bayesian localization via incoherence and sparsity
This paper exploits recent developments in sparse approximation and compressive sensing to efficiently perform localization in a sensor network. We introduce a Bayesian framework...
Volkan Cevher, Petros Boufounos, Richard G. Barani...
IJCAI
1993
15 years 2 months ago
Learning Finite Automata Using Local Distinguishing Experiments
One of the open problems listed in Rivest and Schapire, 1989] is whether and how that the copies of L in their algorithm can be combined into one for better performance. This pape...
Wei-Mein Shen
IJIPT
2010
147views more  IJIPT 2010»
14 years 12 months ago
On investigating ARP spoofing security solutions
: The Address Resolution Protocol (ARP) has proven to work well under regular circumstances, but it was not designed to cope with malicious hosts. By performing ARP spoofing attack...
Zouheir Trabelsi, Wassim El-Hajj
ESWS
2009
Springer
15 years 8 months ago
Ranking Approximate Answers to Semantic Web Queries
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
TVLSI
2010
14 years 8 months ago
Discrete Buffer and Wire Sizing for Link-Based Non-Tree Clock Networks
Clock network is a vulnerable victim of variations as well as a main power consumer in many integrated circuits. Recently, link-based non-tree clock network attracts people's...
Rupak Samanta, Jiang Hu, Peng Li