Sciweavers

1664 search results - page 156 / 333
» Distance labeling in graphs
Sort
View
FPGA
2008
ACM
174views FPGA» more  FPGA 2008»
15 years 6 months ago
Pattern-based behavior synthesis for FPGA resource reduction
Pattern-based synthesis has drawn wide interest from researchers who tried to utilize the regularity in applications for design optimizations. In this paper we present a general p...
Jason Cong, Wei Jiang
SIAMDM
2010
149views more  SIAMDM 2010»
15 years 3 months ago
Formal Theory of Noisy Sensor Network Localization
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...
Brian D. O. Anderson, Iman Shames, Guoqiang Mao, B...
ICASSP
2010
IEEE
15 years 4 months ago
Optimized intrinsic dimension estimator using nearest neighbor graphs
We develop an approach to intrinsic dimension estimation based on k-nearest neighbor (kNN) distances. The dimension estimator is derived using a general theory on functionals of k...
Kumar Sricharan, Raviv Raich, Alfred O. Hero III
DM
1998
94views more  DM 1998»
15 years 4 months ago
On embedding complete graphs into hypercubes
An embedding of Kn into a hypercube is a mapping of the n vertices of Kn to distinct vertices of the hypercube, and the associated cost is the sum over all pairs of (mapped) verti...
Michael Klugerman, Alexander Russell, Ravi Sundara...
COLING
2008
15 years 6 months ago
Learning Reliable Information for Dependency Parsing Adaptation
In this paper, we focus on the adaptation problem that has a large labeled data in the source domain and a large but unlabeled data in the target domain. Our aim is to learn relia...
Wenliang Chen, Youzheng Wu, Hitoshi Isahara