Sciweavers

2080 search results - page 126 / 416
» Measuring empirical computational complexity
Sort
View
CORR
2012
Springer
170views Education» more  CORR 2012»
14 years 4 days ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
MOBIHOC
2002
ACM
16 years 4 months ago
Characterizing the interaction between routing and MAC protocols in ad-hoc networks
We empirically study the effect of mobility and interaction between various input parameters on the performance of protocols designed for wireless ad-hoc networks. An important ob...
Christopher L. Barrett, Achla Marathe, Madhav V. M...
PAKDD
2009
ACM
134views Data Mining» more  PAKDD 2009»
16 years 1 months ago
On Link Privacy in Randomizing Social Networks.
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...
Xiaowei Ying, Xintao Wu
WACV
2007
IEEE
15 years 10 months ago
Video-based Metrology of Water Droplet Spreading on Nanostructured Surfaces
Dynamic wettability of a nanostructured surface is an important property for many liquid-related applications of nanostructures. The dynamic wettability analysis is performed by m...
Samuel Cheng, Xingzhi Luo, Suchendra M. Bhandarkar...
CIBCB
2005
IEEE
15 years 10 months ago
Functional Distances for Genes Based on GO Feature Maps and their Application to Clustering
— With the invention of high throughput methods, researchers are capable of producing large amounts of biological data. During the analysis of such data, the need for a functiona...
Nora Speer, Holger Fröhlich, Christian Spieth...