Sciweavers

3708 search results - page 27 / 742
» Approximating Betweenness Centrality
Sort
View
GIS
2009
ACM
14 years 5 months ago
Constrained reverse nearest neighbor search on mobile objects
In this paper, we formalize the novel concept of Constrained Reverse k-Nearest Neighbor (CRkNN) search on mobile objects (clients) performed at a central server. The CRkNN query c...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
WAOA
2005
Springer
163views Algorithms» more  WAOA 2005»
14 years 4 months ago
Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT
MAX SAT and MAX NAE-SAT are central problems in theoretical computer science. We present an approximation algorithm for MAX NAE-SAT with a conjectured performance guarantee of 0.82...
Adi Avidor, Ido Berkovitch, Uri Zwick
IJCNN
2008
IEEE
14 years 5 months ago
On the sample mean of graphs
— We present an analytic and geometric view of the sample mean of graphs. The theoretical framework yields efficient subgradient methods for approximating a structural mean and ...
Brijnesh J. Jain, Klaus Obermayer
ICC
2007
IEEE
175views Communications» more  ICC 2007»
14 years 5 months ago
A Framework for Dynamic Spectrum Sharing Between Cognitive Radios
— We consider a cognitive radio system like the future 802.22 networks where license-exempt service providers (SPs) will share a fixed spectrum in a non-interference basis to ea...
Joydeep Acharya, Roy D. Yates
ESWS
2005
Springer
14 years 4 months ago
Optimally Distributing Interactions Between Composed Semantic Web Services
When information services are organized to provide some composed functionality, their interactions can be formally represented as workflows. Traditionally, workflows are executed...
Ion Constantinescu, Walter Binder, Boi Faltings