Sciweavers

2252 search results - page 224 / 451
» Improving Random Forests
Sort
View
147
Voted
GCC
2003
Springer
15 years 8 months ago
Dominating-Set-Based Searching in Peer-to-Peer Networks
— The peer-to-peer network for sharing information and data through direct exchange has emerged rapidly in recent years. The searching problem is a basic issue that addresses the...
Chunlin Yang, Jie Wu
ECCV
2010
Springer
15 years 8 months ago
What, Where & How Many? Combining Object Detectors and CRFs
Abstract. Computer vision algorithms for individual tasks such as object recognition, detection and segmentation have shown impressive results in the recent past. The next challeng...
ICDCS
2002
IEEE
15 years 8 months ago
Routing Indices For Peer-to-Peer Systems
Finding information in a peer-to-peer system currently requires either a costly and vulnerable central index, or flooding the network with queries. In this paper we introduce the...
Arturo Crespo, Hector Garcia-Molina
ICALP
2010
Springer
15 years 8 months ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß
137
Voted
INFOCOM
2000
IEEE
15 years 7 months ago
Comparisons of Packet Scheduling Algorithms for Fair Service Among Connections on the Internet
Abstract—We investigate the performance of TCP under three representatives of packet scheduling algorithms at the router. Our main focus is to investigate how fair service can be...
Go Hasegawa, Takahiro Matsuo, Masayuki Murata, Hid...