Sciweavers

570 search results - page 84 / 114
» Intrinsic Geometries in Learning
Sort
View
SPAA
2004
ACM
14 years 1 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
MOBICOM
2003
ACM
14 years 25 days ago
Topology control for wireless sensor networks
We consider a two-tiered Wireless Sensor Network (WSN) consisting of sensor clusters deployed around strategic locations and base-stations (BSs) whose locations are relatively fl...
Jianping Pan, Yiwei Thomas Hou, Lin Cai, Yi Shi, S...
SIGGRAPH
1999
ACM
13 years 12 months ago
Computing Exact Shadow Irradiance Using Splines
We present a solution to the general problem of characterizing shadows in scenes involving a uniform polygonal area emitter and a polygonal occluder in arbitrary position by manif...
Michael M. Stark, Elaine Cohen, Tom Lyche, Richard...
CSB
2004
IEEE
112views Bioinformatics» more  CSB 2004»
13 years 11 months ago
Reasoning about Molecular Similarity and Properties
Ascertaining the similarity amongst molecules is a fundamental problem in biology and drug discovery. Since similar molecules tend to have similar biological properties, the notio...
Rahul Singh
CIARP
2008
Springer
13 years 9 months ago
Pose Estimation for Sensors Which Capture Cylindric Panoramas
This paper shows that there exist linear models for sensor pose estimation for multi-view panoramas defined by a symmetric or leveled pair of cylindric images. It assumes that pair...
Fay Huang, Reinhard Klette, Yun-Hao Xie