Sciweavers

633 search results - page 36 / 127
» Locality and Hard SAT-Instances
Sort
View
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 10 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
IPPS
2008
IEEE
14 years 4 months ago
LiteLoad: Content unaware routing for localizing P2P protocols
In today’s extensive worldwide Internet traffic, some 60% of network congestion is caused by Peer to Peer sessions. Consequently ISPs are facing many challenges like: paying fo...
Shay Horovitz, Danny Dolev
KDD
2005
ACM
178views Data Mining» more  KDD 2005»
14 years 3 months ago
Failure detection and localization in component based systems by online tracking
The increasing complexity of today’s systems makes fast and accurate failure detection essential for their use in mission-critical applications. Various monitoring methods provi...
Haifeng Chen, Guofei Jiang, Cristian Ungureanu, Ke...
AIRWEB
2008
Springer
13 years 12 months ago
Robust PageRank and locally computable spam detection features
Since the link structure of the web is an important element in ranking systems on search engines, web spammers widely use the link structure of the web to increase the rank of the...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...
ICDT
2010
ACM
163views Database» more  ICDT 2010»
13 years 8 months ago
Composing Local-As-View Mappings
Schema mapping composition is a fundamental operation in schema management and data exchange. The mapping composition problem has been extensively studied for a number of mapping ...
Patricia Arocena, Ariel Fuxman, Renee Miller