Sciweavers

2107 search results - page 207 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
DAM
2007
105views more  DAM 2007»
15 years 3 months ago
Recognizing and representing proper interval graphs in parallel using merging and sorting
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
Jørgen Bang-Jensen, Jing Huang, Louis Ibarr...
SIGCOMM
2010
ACM
15 years 4 months ago
Source flow: handling millions of flows on flow-based nodes
Flow-based networks such as OpenFlow-based networks have difficulty handling a large number of flows in a node due to the capacity limitation of search engine devices such as tern...
Yasunobu Chiba, Yusuke Shinohara, Hideyuki Shimoni...
CIS
2004
Springer
15 years 9 months ago
Algorithms for Loosely Constrained Multiple Sequence Alignment
For finding accurate and biologically meaningful multiple sequence alignment, it is required to consider a loosely constrained version of multiple sequence alignment. This paper is...
Bin Song, Fengfeng Zhou, Guoliang Chen
ICMCS
2010
IEEE
194views Multimedia» more  ICMCS 2010»
15 years 4 months ago
Speech emotion estimation in 3D space
Speech processing is an important aspect of affective computing. Most research in this direction has focused on classifying emotions into a small number of categories. However, nu...
Dongrui Wu, Thomas D. Parsons, Emily Mower, Shrika...
CISS
2008
IEEE
15 years 10 months ago
Compressed channel sensing
—Reliable wireless communications often requires accurate knowledge of the underlying multipath channel. This typically involves probing of the channel with a known training wave...
Waheed Uz Zaman Bajwa, Jarvis Haupt, Gil M. Raz, R...