Sciweavers

905 search results - page 150 / 181
» On the Complexity of uSPR Distance
Sort
View
DSD
2002
IEEE
96views Hardware» more  DSD 2002»
14 years 11 days ago
Networks on Silicon: Blessing or Nightmare?
Continuing VLSI technology scaling raises several deep submicron (DSM) problems like relatively slow interconnect, power dissipation and distribution, and signal integrity. Those ...
Paul Wielage, Kees G. W. Goossens
IDA
2000
Springer
13 years 7 months ago
Supervised model-based visualization of high-dimensional data
When high-dimensional data vectors are visualized on a two- or three-dimensional display, the goal is that two vectors close to each other in the multi-dimensional space should als...
Petri Kontkanen, Jussi Lahtinen, Petri Myllymä...
PR
2007
189views more  PR 2007»
13 years 7 months ago
Information cut for clustering using a gradient descent approach
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
Robert Jenssen, Deniz Erdogmus, Kenneth E. Hild II...
SAC
2008
ACM
13 years 6 months ago
Adaptive methods for sequential importance sampling with application to state space models
Abstract. In this paper we discuss new adaptive proposal strategies for sequential Monte Carlo algorithms--also known as particle filters--relying on new criteria evaluating the qu...
Julien Cornebise, Eric Moulines, Jimmy Olsson
NAR
2007
91views more  NAR 2007»
13 years 7 months ago
RNABindR: a server for analyzing and predicting RNA-binding sites in proteins
Understanding interactions between proteins and RNA is key to deciphering the mechanisms of many important biological processes. Here we describe RNABindR, a web-based server that...
Michael Terribilini, Jeffry D. Sander, Jae-Hyung L...