Sciweavers

1941 search results - page 124 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
KDD
2012
ACM
201views Data Mining» more  KDD 2012»
13 years 13 days ago
Low rank modeling of signed networks
Trust networks, where people leave trust and distrust feedback, are becoming increasingly common. These networks may be regarded as signed graphs, where a positive edge weight cap...
Cho-Jui Hsieh, Kai-Yang Chiang, Inderjit S. Dhillo...
MFCS
2005
Springer
15 years 3 months ago
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
Piotr Krysta
MOBIHOC
2006
ACM
15 years 9 months ago
Message ferry route design for sparse ad hoc networks with mobile nodes
Message ferrying is a networking paradigm where a special node, called a message ferry, facilitates the connectivity in a mobile ad hoc network where the nodes are sparsely deploy...
Muhammad Mukarram Bin Tariq, Mostafa H. Ammar, Ell...
DAC
2004
ACM
15 years 11 months ago
Efficient power/ground network analysis for power integrity-driven design methodology
As technology advances, the metal width is decreasing with the length increasing, making the resistance along the power line increase substantially. Together with the nonlinear sc...
Su-Wei Wu, Yao-Wen Chang
PG
2007
IEEE
15 years 4 months ago
Extending Catmull-Clark Subdivision and PCCM with Polar Structures
We complete and bring together two pairs of surface constructions that use polynomial pieces of degree (3,3) to associate a smooth surface with a mesh. The two pairs complement ea...
Ashish Myles, Kestutis Karciauskas, Jörg Pete...