Sciweavers

3267 search results - page 445 / 654
» Generalized quasirandom graphs
Sort
View
HICSS
2002
IEEE
212views Biometrics» more  HICSS 2002»
15 years 11 months ago
Connectivity-Based k-Hop Clustering in Wireless Networks
Abstract. In this paper we describe several new clustering algorithms for nodes in a mobile ad hoc network. The main contribution is to generalize the cluster definition and forma...
Geng Chen, Fabian Garcia Nocetti, Julio Solano-Gon...
PODC
2009
ACM
15 years 11 months ago
Brief announcement: locality-based aggregate computation in wireless sensor networks
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
Jen-Yeu Chen, Gopal Pandurangan, Jianghai Hu
FOCS
2000
IEEE
15 years 11 months ago
On Clusterings - Good, Bad and Spectral
We motivate and develop a natural bicriteria measure for assessing the quality of a clustering that avoids the drawbacks of existing measures. A simple recursive heuristic is shown...
Ravi Kannan, Santosh Vempala, Adrian Vetta
SIGGRAPH
2000
ACM
15 years 11 months ago
Interactive multi-pass programmable shading
Programmable shading is a common technique for production animation, but interactive programmable shading is not yet widely available. We support interactive programmable shading ...
Mark S. Peercy, Marc Olano, John Airey, P. Jeffrey...
ECAI
2000
Springer
15 years 11 months ago
Incremental Forward Checking for the Disjunctive Temporal Problem
Abstract. This paper studies algorithms for the Disjunctive Temporal Problem (DTP) a quite general temporal reasoning problem introduced in [12]. This problem involves the satisfac...
Angelo Oddi, Amedeo Cesta