Sciweavers

667 search results - page 88 / 134
» Approximation algorithms for connected facility location pro...
Sort
View
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
15 years 10 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
103
Voted
INFOCOM
2003
IEEE
15 years 5 months ago
Algorithms for Computing QoS Paths with Restoration
— There is a growing interest among service providers to offer new services with Quality of Service (QoS) guaranties that are also resilient to failures. Supporting QoS connectio...
Yigal Bejerano, Yuri Breitbart, Rajeev Rastogi, Al...
WWW
2009
ACM
16 years 1 months ago
An axiomatic approach for result diversification
Understanding user intent is key to designing an effective ranking system in a search engine. In the absence of any explicit knowledge of user intent, search engines want to diver...
Sreenivas Gollapudi, Aneesh Sharma
GECCO
2007
Springer
182views Optimization» more  GECCO 2007»
15 years 6 months ago
Generating large-scale neural networks through discovering geometric regularities
Connectivity patterns in biological brains exhibit many repeating motifs. This repetition mirrors inherent geometric regularities in the physical world. For example, stimuli that ...
Jason Gauci, Kenneth O. Stanley
104
Voted
ICRA
2007
IEEE
180views Robotics» more  ICRA 2007»
15 years 6 months ago
Mobile Sensor Networks Self Localization based on Multi-dimensional Scaling
— In this paper, we define a mobile self-localization (MSL) problem for sparse mobile sensor networks, and propose an algorithm named Mobility Assisted MDS-MAP(P), based on Mult...
Changhua Wu, Weihua Sheng, Ying Zhang