Sciweavers

2252 search results - page 196 / 451
» Improving Random Forests
Sort
View
216
Voted
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
16 years 4 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
136
Voted
BIBM
2008
IEEE
113views Bioinformatics» more  BIBM 2008»
15 years 9 months ago
Towards Site-Based Protein Functional Annotations
Abstract—The exact relationship between protein active centers and protein functions is unclear even after decades of intensive study. To improve the functional prediction abilit...
Seak Fei Lei, Jun Huan
120
Voted
GLOBECOM
2007
IEEE
15 years 9 months ago
Mobility-Assisted Sensor Networking for Field Coverage
—In many sensor network applications, manual or well-controlled node deployment is not practical. Random deployments, e.g., from the air, often result in unevenly distributed nod...
Dan Wang, Jiangchuan Liu, Qian Zhang
125
Voted
GLOBECOM
2007
IEEE
15 years 9 months ago
V-BLAST Receiver for MIMO Relay Networks with Imperfect CSI
—Previous work demonstrated that the improvements in spectral efficiency and link reliability can be obtained in wireless relay networks employing terminals with MIMO capability...
Jiansong Chen, Xiaoli Yu, C. C. Jay Kuo
111
Voted
WEA
2007
Springer
117views Algorithms» more  WEA 2007»
15 years 8 months ago
Better Landmarks Within Reach
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F....