3625 search results - page 550 / 725 » On Timed Models of Gene Networks |
266
click to vote
ICDE
2005
IEEE
16 years 5 months ago
2005
IEEE
Query processing in traditional information management systems has moved from an exact match model to more flexible paradigms allowing cooperative retrieval by aggregating the dat...
161
click to vote
WWW
2007
ACM
16 years 4 months ago
2007
ACM
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
147
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
145
click to vote
KDD
2009
ACM
15 years 11 months ago
2009
ACM
Max-margin Markov networks (M3 N) have shown great promise in structured prediction and relational learning. Due to the KKT conditions, the M3 N enjoys dual sparsity. However, the...
126
click to vote
ADHOCNOW
2007
Springer
15 years 10 months ago
2007
Springer
We present a distributed topology control protocol that runs on a d-QUDG for d ≥ 1/ √ 2, and computes a sparse, constant-spanner, both in Euclidean distance and in hop distance...