Sciweavers

3708 search results - page 101 / 742
» Approximating Betweenness Centrality
Sort
View
ADHOC
2010
292views more  ADHOC 2010»
15 years 24 days ago
Sleep/wake scheduling for multi-hop sensor networks: Non-convexity and approximation algorithm
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...
Yan Wu, Sonia Fahmy, Ness B. Shroff
80
Voted
PAKDD
2005
ACM
112views Data Mining» more  PAKDD 2005»
15 years 6 months ago
Approximated Clustering of Distributed High-Dimensional Data
In many modern application ranges high-dimensional feature vectors are used to model complex real-world objects. Often these objects reside on different local sites. In this paper,...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
92
Voted
FOCS
1993
IEEE
15 years 4 months ago
On Bounded Queries and Approximation
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
Richard Chang, William I. Gasarch
97
Voted
HICSS
2006
IEEE
170views Biometrics» more  HICSS 2006»
15 years 6 months ago
A Complex Adaptive System Perspective of Enterprise Architecture in Electronic Government
Within the public sector, the deployment of enterprise architecture is often an attempt to address the decentralization/centralization relationships to improve the links between t...
Marijn Janssen, George Kuk
115
Voted
ICPP
2003
IEEE
15 years 6 months ago
Distributed Page Ranking in Structured P2P Networks
This paper discusses the techniques of performing distributed page ranking on top of structured peer-to-peer networks. Distributed page ranking are needed because the size of the ...
Shuming Shi, Jin Yu, Guangwen Yang, Dingxing Wang