Sciweavers

239 search results - page 45 / 48
» Hardness and algorithms for rainbow connection
Sort
View
CIKM
2005
Springer
15 years 3 months ago
Query workload-aware overlay construction using histograms
Peer-to-peer (p2p) systems offer an efficient means of data sharing among a dynamically changing set of a large number of autonomous nodes. Each node in a p2p system is connected...
Georgia Koloniari, Yannis Petrakis, Evaggelia Pito...
EMSOFT
2005
Springer
15 years 3 months ago
Deeply embedded XML communication: towards an interoperable and seamless world
Current consumer electronics devices do not interoperate and are hard to use. Devices use proprietary, device-specific and inflexible protocols. Resources across device classes, s...
Johannes Helander
81
Voted
CIKM
2004
Springer
15 years 2 months ago
Hierarchical document categorization with support vector machines
Automatically categorizing documents into pre-defined topic hierarchies or taxonomies is a crucial step in knowledge and content management. Standard machine learning techniques ...
Lijuan Cai, Thomas Hofmann
IMC
2003
ACM
15 years 2 months ago
On inferring and characterizing internet routing policies
Border Gateway Protocol allows Autonomous Systems (ASs) to apply diverse routing policies for selecting routes and for propagating reachability information to other ASs. Although ...
Feng Wang, Lixin Gao
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
15 years 2 months ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...