Sciweavers

5595 search results - page 160 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
157
Voted
INTERNET
2006
157views more  INTERNET 2006»
15 years 5 months ago
Distributed Data Mining in Peer-to-Peer Networks
Distributed data mining deals with the problem of data analysis in environments with distributed data, computing nodes, and users. Peer-to-peer computing is emerging as a new dist...
Souptik Datta, Kanishka Bhaduri, Chris Giannella, ...
159
Voted
CORR
2007
Springer
167views Education» more  CORR 2007»
15 years 5 months ago
Approximation Algorithms for Orienteering with Time Windows
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
Chandra Chekuri, Nitish Korula
135
Voted
CORR
2010
Springer
80views Education» more  CORR 2010»
15 years 5 months ago
Many-to-Many Graph Matching: a Continuous Relaxation Approach
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
INFOCOM
2008
IEEE
15 years 11 months ago
Approximation Algorithms for Scheduling Real-Time Multicast Flows in Wireless LANs
—Abstract—In recent years, numerous large-scale Wireless LANs (WLAN) have been deployed all over the world. However, the shortage of non-interfering channels makes it a challen...
Yigal Bejerano, Dongwook Lee, Prasun Sinha, Lisa Z...
152
Voted
ICC
2009
IEEE
140views Communications» more  ICC 2009»
15 years 2 months ago
Approximation Algorithms for Traffic Grooming in WDM Rings
Abstract-- This paper addresses the problem of traffic grooming in WDM rings in which all traffic emanates from a single node and all other nodes are destination nodes. This "...
Kevin Corcoran, Seth Flaxman, Mark Neyer, Peter Sc...