Sciweavers

222 search results - page 24 / 45
» Symmetry and Search in a Network Design Problem
Sort
View
CORR
2008
Springer
153views Education» more  CORR 2008»
15 years 2 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...
119
Voted
NDSS
2005
IEEE
15 years 7 months ago
Privacy-Preserving Friends Troubleshooting Network
— Content sharing is a popular use of peer-to-peer systems because of their inherent scalability and low cost of maintenance. In this paper, we leverage this nature of peer-topee...
Qiang Huang, Helen J. Wang, Nikita Borisov
KDD
2010
ACM
300views Data Mining» more  KDD 2010»
15 years 10 days ago
Using data mining techniques to address critical information exchange needs in disaster affected public-private networks
Crisis Management and Disaster Recovery have gained immense importance in the wake of recent man and nature inflicted calamities. A critical problem in a crisis situation is how t...
Li Zheng, Chao Shen, Liang Tang, Tao Li, Steven Lu...
104
Voted
DAC
2006
ACM
16 years 2 months ago
Efficient SAT-based Boolean matching for FPGA technology mapping
Most FPGA technology mapping approaches either target Lookup Tables (LUTs) or relatively simple Programmable Logic Blocks (PLBs). Considering networks of PLBs during technology map...
Sean Safarpour, Andreas G. Veneris, Gregg Baeckler...
111
Voted
CCR
2006
117views more  CCR 2006»
15 years 1 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav