Sciweavers

1258 search results - page 175 / 252
» Architecture-driven Problem Decomposition
Sort
View
PODS
2006
ACM
104views Database» more  PODS 2006»
14 years 9 months ago
Tractable database design through bounded treewidth
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
Georg Gottlob, Reinhard Pichler, Fang Wei
MOBIHOC
2006
ACM
14 years 8 months ago
Proportionally fair allocation of end-to-end bandwidth in STDMA wireless networks
We consider the problem of designing distributed mechanisms for joint congestion control and resource allocation in spatial-reuse TDMA wireless networks. The design problem is pos...
Pablo Soldati, Björn Johansson, Mikael Johans...
IWOCA
2009
Springer
153views Algorithms» more  IWOCA 2009»
14 years 3 months ago
Feedback Vertex Set on Graphs of Low Cliquewidth
The Feedback Vertex Set problem asks whether a graph contains q vertices meeting all its cycles. This is not a local property, in the sense that we cannot check if q vertices meet...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
SECON
2008
IEEE
14 years 3 months ago
Congestion Control and Channel Assignment in Multi-Radio Wireless Mesh Networks
— We address the problem of congestion control in multi-radio, multi-channel, wireless mesh networks. Compared to its single radio counterpart for which solutions exist, this pro...
Anastasios Giannoulis, Theodoros Salonidis, Edward...
ADC
2006
Springer
158views Database» more  ADC 2006»
14 years 2 months ago
Dimensionality reduction in patch-signature based protein structure matching
Searching bio-chemical structures is becoming an important application domain of information retrieval. This paper introduces a protein structure matching problem and formulates i...
Zi Huang, Xiaofang Zhou, Dawei Song, Peter Bruza