Sciweavers

2004 search results - page 184 / 401
» Sampling from large graphs
Sort
View
SENSYS
2003
ACM
15 years 8 months ago
GEM: graph eMbedding for routing and data-centric storage in sensor networks without geographic information
The widespread deployment of sensor networks is on the horizon. One of the main challenges in sensor networks is to process and aggregate data in the network rather than wasting e...
James Newsome, Dawn Xiaodong Song
119
Voted
SDM
2007
SIAM
177views Data Mining» more  SDM 2007»
15 years 4 months ago
Multi-way Clustering on Relation Graphs
A number of real-world domains such as social networks and e-commerce involve heterogeneous data that describes relations between multiple classes of entities. Understanding the n...
Arindam Banerjee, Sugato Basu, Srujana Merugu
170
Voted
ISPD
2012
ACM
283views Hardware» more  ISPD 2012»
13 years 11 months ago
Low-power gated bus synthesis for 3d ic via rectilinear shortest-path steiner graph
In this paper, we propose a new approach for gated bus synthesis [16] with minimum wire capacitance per transaction in three-dimensional (3D) ICs. The 3D IC technology connects di...
Chung-Kuan Cheng, Peng Du, Andrew B. Kahng, Shih-H...
MM
2004
ACM
178views Multimedia» more  MM 2004»
15 years 9 months ago
A bootstrapping framework for annotating and retrieving WWW images
Most current image retrieval systems and commercial search engines use mainly text annotations to index and retrieve WWW images. This research explores the use of machine learning...
HuaMin Feng, Rui Shi, Tat-Seng Chua
CORR
2011
Springer
203views Education» more  CORR 2011»
14 years 10 months ago
Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
The Compressive Sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by reducing the sampling rate required to acquire and stably recover sparse s...
Laurent Jacques, Jason N. Laska, Petros Boufounos,...