Sciweavers

388 search results - page 54 / 78
» An approximate algorithm for median graph computation using ...
Sort
View
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
14 years 19 days ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
SPAA
2005
ACM
14 years 1 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
ICASSP
2011
IEEE
12 years 11 months ago
Scalable robust hypothesis tests using graphical models
Traditional binary hypothesis testing relies on the precise knowledge of the probability density of an observed random vector conditioned on each hypothesis. However, for many app...
Divyanshu Vats, Vishal Monga, Umamahesh Srinivas, ...
PG
1997
IEEE
14 years 12 hour ago
3D geometric metamorphosis based on harmonic map
Recently, animations with deforming objects are frequently used in various Computer Graphics applications. Metamorphosis (or morphing) of three dimensional objects is one of techn...
Takashi Kanai, Hiromasa Suzuki, Fumihiko Kimura
ICC
2007
IEEE
176views Communications» more  ICC 2007»
14 years 2 months ago
An Interference-Aware Channel Assignment Scheme for Wireless Mesh Networks
—Multichannel communication in a Wireless Mesh Network with routers having multiple radio interfaces significantly enhances the network capacity. Efficient channel assignment an...
Arunabha Sen, Sudheendra Murthy, Samrat Ganguly, S...