Sciweavers

2988 search results - page 528 / 598
» Experiments with a New Boosting Algorithm
Sort
View
SIGSOFT
2006
ACM
15 years 3 months ago
Memories of bug fixes
The change history of a software project contains a rich collection of code changes that record previous development experience. Changes that fix bugs are especially interesting, ...
Sunghun Kim, Kai Pan, E. James Whitehead Jr.
INFOCOM
2005
IEEE
15 years 3 months ago
Improving VoIP quality through path switching
Abstract— The current best-effort Internet cannot readily provide the service guarantees that VoIP applications often require. Path switching can potentially address this problem...
Shu Tao, Kuai Xu, Antonio Estepa, Teng Fei, Lixin ...
PPOPP
2005
ACM
15 years 3 months ago
Automated type-based analysis of data races and atomicity
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose at run-time. This motivated the development of type systems that statically en...
Amit Sasturkar, Rahul Agarwal, Liqiang Wang, Scott...
ACMMSP
2004
ACM
92views Hardware» more  ACMMSP 2004»
15 years 3 months ago
Instruction combining for coalescing memory accesses using global code motion
Instruction combining is an optimization to replace a sequence of instructions with a more efficient instruction yielding the same result in a fewer machine cycles. When we use it...
Motohiro Kawahito, Hideaki Komatsu, Toshio Nakatan...
SIGMOD
2010
ACM
262views Database» more  SIGMOD 2010»
15 years 2 months ago
K-nearest neighbor search for fuzzy objects
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...
Kai Zheng, Gabriel Pui Cheong Fung, Xiaofang Zhou