Sciweavers

213 search results - page 26 / 43
» The randomized complexity of initial value problems
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Probabilistic SINR constrained robust transmit beamforming: A Bernstein-type inequality based conservative approach
Recently, robust transmit beamforming has drawn considerable attention because it can provide guaranteed receiver performance in the presence of channel state information (CSI) er...
Kun-Yu Wang, Tsung-Hui Chang, Wing-Kin Ma, Anthony...
BIOCOMP
2007
13 years 9 months ago
Quality-Based Similarity Search for Biological Sequence Databases
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ï...
Xuehui Li, Tamer Kahveci
STOC
2007
ACM
140views Algorithms» more  STOC 2007»
14 years 8 months ago
On the submodularity of influence in social networks
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
Elchanan Mossel, Sébastien Roch
DATE
2010
IEEE
139views Hardware» more  DATE 2010»
13 years 11 months ago
Finding reset nondeterminism in RTL designs - scalable X-analysis methodology and case study
Due to increases in design complexity, routing a reset signal to all registers is becoming more difficult. One way to solve this problem is to reset only certain registers and rely...
Hong-Zu Chou, Haiqian Yu, Kai-Hui Chang, Dylan Dob...
ICIP
2005
IEEE
14 years 9 months ago
Segmenting small regions in the presence of noise
Binary segmentation, a problem of extracting foreground objects from the background, often arises in medical imaging and document processing. Popular existing solutions include Ex...
Rashi Samur, Vitali Zagorodnov