Sciweavers

178 search results - page 29 / 36
» Computing Longest Previous Factor in linear time and applica...
Sort
View
RECOMB
2006
Springer
14 years 8 months ago
A Study of Accessible Motifs and RNA Folding Complexity
mRNA molecules are folded in the cells and therefore many of their substrings may actually be inaccessible to protein and microRNA binding. The need to apply an accessability crite...
Ydo Wexler, Chaya Ben-Zaken Zilberstein, Michal Zi...
TCAD
2010
168views more  TCAD 2010»
13 years 3 months ago
An MILP-Based Performance Analysis Technique for Non-Preemptive Multitasking MPSoC
For real-time applications, it is necessary to estimate the worst-case performance early in the design process without actual hardware implementation. While the non-preemptive task...
Hoeseok Yang, Sungchan Kim, Soonhoi Ha
HUC
2009
Springer
14 years 1 months ago
Discovering semantically meaningful places from pervasive RF-beacons
Detecting visits to semantically meaningful places is important for many emerging mobile applications. We present PlaceSense, a place discovery algorithm suitable for mobile devic...
Donnie H. Kim, Jeffrey Hightower, Ramesh Govindan,...
SIGMOD
2008
ACM
157views Database» more  SIGMOD 2008»
14 years 8 months ago
CRD: fast co-clustering on large datasets utilizing sampling-based matrix decomposition
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...
Feng Pan, Xiang Zhang, Wei Wang 0010
TALG
2010
158views more  TALG 2010»
13 years 3 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...