Sciweavers

6365 search results - page 1122 / 1273
» Fast Local Computation Algorithms
Sort
View
CEC
2005
IEEE
16 years 4 days ago
Multiobjective clustering around medoids
Abstract- The large majority of existing clustering algorithms are centered around the notion of a feature, that is, individual data items are represented by their intrinsic proper...
Julia Handl, Joshua D. Knowles
ESA
2007
Springer
153views Algorithms» more  ESA 2007»
15 years 10 months ago
Tradeoffs and Average-Case Equilibria in Selfish Routing
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
Martin Hoefer, Alexander Souza
INFOCOM
2010
IEEE
15 years 5 months ago
Asymmetry-Aware Real-Time Distributed Joint Resource Allocation in IEEE 802.22 WRANs
—In IEEE 802.22 Wireless Regional Area Networks (WRANs), each Base Station (BS) solves a complex resource allocation problem of simultaneously determining the channel to reuse, p...
Hyoil Kim, Kang G. Shin
MOBIHOC
2012
ACM
13 years 9 months ago
Spatial spectrum access game: nash equilibria and distributed learning
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
Xu Chen, Jianwei Huang
COMPGEOM
2006
ACM
16 years 14 days ago
Envelope surfaces
We construct a class of envelope surfaces in Rd , more precisely envelopes of balls. An envelope surface is a closed C1 (tangent continuous) manifold wrapping tightly around the u...
Nico Kruithof, Gert Vegter
« Prev « First page 1122 / 1273 Last » Next »