Sciweavers

2693 search results - page 530 / 539
» French Order Without Order
Sort
View
CGO
2011
IEEE
12 years 11 months ago
Language and compiler support for auto-tuning variable-accuracy algorithms
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
Jason Ansel, Yee Lok Wong, Cy P. Chan, Marek Olsze...
ICASSP
2011
IEEE
12 years 11 months ago
On single-channel noise reduction in the time domain
In this paper, we revisit the noise-reduction problem in the time domain and present a way to decompose the ltered speech into two uncorrelated (orthogonal) components: the desire...
Jingdong Chen, Jacob Benesty, Yiteng Huang, Tomas ...
ICDE
2011
IEEE
244views Database» more  ICDE 2011»
12 years 11 months ago
Algorithms for local sensor synchronization
— In a wireless sensor network (WSN), each sensor monitors environmental parameters, and reports its readings to a base station, possibly through other nodes. A sensor works in c...
Lixing Wang, Yin Yang, Xin Miao, Dimitris Papadias...
ICST
2011
IEEE
12 years 11 months ago
EFindBugs: Effective Error Ranking for FindBugs
—Static analysis tools have been widely used to detect potential defects without executing programs. It helps programmers raise the awareness about subtle correctness issues in t...
Haihao Shen, Jianhong Fang, Jianjun Zhao
APN
2011
Springer
12 years 11 months ago
On the Origin of Events: Branching Cells as Stubborn Sets
In prime event structures with binary conflicts (pes-bc)3 a branching cell [1] is a subset of events closed under downward causality and immediate conflict relations. This means ...
Henri Hansen, Xu Wang