948 search results - page 39 / 190 » What can we achieve by arbitrary announcements |
NIPS
2008
13 years 9 months ago
2008
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We investigate the role of cooperation in wireless networks subject to a spatial degrees of freedom limitation. To address the worst case scenario, we consider a free-space lineof-...
ECCV
1994
Springer
14 years 9 months ago
1994
Springer
Abstract. This paper presents a new algorithm for structure from motion from an arbitrary number of tracked features over an arbitrary number of images, which possesses several adv...
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...
WEBI
2010
Springer
13 years 5 months ago
2010
Springer
The current search engine model considers users not trustworthy, so no tools are provided to let them specify what they are looking for or in what context, which severely limits wh...