Sciweavers

2192 search results - page 250 / 439
» Algorithms for Challenging Motif Problems
Sort
View
WSNA
2003
ACM
15 years 9 months ago
Analysis on the redundancy of wireless sensor networks
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
Yong Gao, Kui Wu, Fulu Li
PODS
2010
ACM
232views Database» more  PODS 2010»
15 years 9 months ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
RECOMB
2010
Springer
15 years 5 months ago
Leveraging Sequence Classification by Taxonomy-Based Multitask Learning
In this work we consider an inference task that biologists are very good at: deciphering biological processes by bringing together knowledge that has been obtained by experiments u...
Christian Widmer, Jose Leiva, Yasemin Altun, Gunna...
CORR
2010
Springer
177views Education» more  CORR 2010»
15 years 4 months ago
Supervised Random Walks: Predicting and Recommending Links in Social Networks
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
Lars Backstrom, Jure Leskovec
119
Voted
CVPR
2007
IEEE
16 years 5 months ago
A Fast 3D Correspondence Method for Statistical Shape Modeling
Accurately identifying corresponded landmarks from a population of shape instances is the major challenge in constructing statistical shape models. In this paper, we address this ...
Pahal Dalal, Brent C. Munsell, Song Wang, Jijun Ta...