Sciweavers

2899 search results - page 417 / 580
» Dynamic Trees in Practice
Sort
View
ICSE
2004
IEEE-ACM
14 years 10 months ago
Finding Latent Code Errors via Machine Learning over Program Executions
This paper proposes a technique for identifying program properties that indicate errors. The technique generates machine learning models of program properties known to result from...
Yuriy Brun, Michael D. Ernst
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
14 years 7 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu
EUROGRAPHICS
2010
Eurographics
14 years 6 months ago
Bidirectional Search for Interactive Motion Synthesis
We present an approach to improve the search efficiency for near-optimal motion synthesis using motion graphs. An optimal or near-optimal path through a motion graph often leads ...
Wan-Yen Lo and Matthias Zwicker
INFOCOM
2009
IEEE
14 years 5 months ago
Towards Economically Viable Infrastructure-Based Overlay Multicast Networks
—Internet-scale dissemination of streaming contents (e.g., live sports games) can be achieved by infrastructure-based overlay multicast networks, where multicast service provider...
Varun Khare, Bo Zhang
IROS
2009
IEEE
151views Robotics» more  IROS 2009»
14 years 5 months ago
Stochastic mobility-based path planning in uncertain environments
— The ability of mobile robots to generate feasible trajectories online is an important requirement for their autonomous operation in unstructured environments. Many path generat...
Gaurav Kewlani, Genya Ishigami, Karl Iagnemma