Sciweavers

8728 search results - page 1434 / 1746
» On Reduct Construction Algorithms
Sort
View
SAS
2012
Springer
208views Formal Methods» more  SAS 2012»
13 years 9 months ago
Finding Non-terminating Executions in Distributed Asynchronous Programs
Programming distributed and reactive asynchronous systems is complex due to the lack of synchronization between concurrently executing tasks, and arbitrary delay of message-based c...
Michael Emmi, Akash Lal
CVPR
2008
IEEE
16 years 8 months ago
Precise detailed detection of faces and facial features
Face detection has advanced dramatically over the past three decades. Algorithms can now quite reliably detect faces in clutter in or near real time. However, much still needs to ...
Liya Ding, Aleix M. Martínez
VIS
2004
IEEE
136views Visualization» more  VIS 2004»
16 years 8 months ago
Visibility Culling for Time-Varying Volume Rendering Using Temporal Occlusion Coherence
Typically there is a high coherence in data values between neighboring time steps in an iterative scientific software simulation; this characteristic similarly contributes to a co...
Jinzhu Gao, Han-Wei Shen, Jian Huang, James Arthur...
SIGSOFT
2005
ACM
16 years 7 months ago
Permissive interfaces
A modular program analysis considers components independently and provides succinct summaries for each component, which can be used when checking the rest of the system. Consider ...
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar
WWW
2007
ACM
16 years 7 months ago
GigaHash: scalable minimal perfect hashing for billions of urls
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
Kumar Chellapilla, Anton Mityagin, Denis Xavier Ch...
« Prev « First page 1434 / 1746 Last » Next »