Sciweavers

9572 search results - page 1705 / 1915
» Cover Algorithms and Their Combination
Sort
View
155
Voted
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
16 years 1 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
WWW
2010
ACM
15 years 11 months ago
Large-scale bot detection for search engines
In this paper, we propose a semi-supervised learning approach for classifying program (bot) generated web search traffic from that of genuine human users. The work is motivated by...
Hongwen Kang, Kuansan Wang, David Soukal, Fritz Be...
SI3D
2009
ACM
15 years 11 months ago
Soft irregular shadow mapping: fast, high-quality, and robust soft shadows
We introduce a straightforward, robust, and efficient algorithm for rendering high-quality soft shadows in dynamic scenes. Each frame, points in the scene visible from the eye ar...
Gregory S. Johnson, Warren A. Hunt, Allen Hux, Wil...
TACAS
2009
Springer
101views Algorithms» more  TACAS 2009»
15 years 11 months ago
Parametric Trace Slicing and Monitoring
Analysis of execution traces plays a fundamental role in many program analysis approaches. Execution traces are frequently parametric, i.e., they contain events with parameter bind...
Feng Chen, Grigore Rosu
ICASSP
2009
IEEE
15 years 11 months ago
Scalable distributed source coding
This paper considers the problem of scalable distributed coding of correlated sources that are communicated to a central unit. The general setting is typically encountered in sens...
Ankur Saxena, Kenneth Rose
« Prev « First page 1705 / 1915 Last » Next »