Sciweavers

1002 search results - page 118 / 201
» Towards Graph Programs for Graph Algorithms
Sort
View
ALGOSENSORS
2009
Springer
15 years 4 months ago
Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
AOSD
2007
ACM
15 years 10 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
WISEC
2009
ACM
16 years 1 months ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...
CIVR
2008
Springer
125views Image Analysis» more  CIVR 2008»
15 years 8 months ago
Leveraging user query log: toward improving image data clustering
Image clustering is useful in many retrieval and classification applications. The main goal of image clustering is to partition a given dataset into salient clusters such that the...
Hao Cheng, Kien A. Hua, Khanh Vu
IPM
2008
141views more  IPM 2008»
15 years 6 months ago
Towards a unified approach to document similarity search using manifold-ranking of blocks
Document similarity search (i.e. query by example) aims to retrieve a ranked list of documents similar to a query document in a text corpus or on the Web. Most existing approaches...
Xiaojun Wan, Jianwu Yang, Jianguo Xiao