Sciweavers

298 search results - page 28 / 60
» Computation hierarchy for in-network processing
Sort
View
ICCV
1999
IEEE
16 years 7 months ago
Dynamic Feature Ordering for Efficient Registration
Existing sequential feature-based registration algorithms involving search typically either select features randomly (eg. the RANSAC[8] approach) or assume a predefined, intuitive...
Tat-Jen Cham, James M. Rehg
CHI
2010
ACM
16 years 4 days ago
The effect of audience design on labeling, organizing, and finding shared files
In an online experiment, I apply theory from psychology and communications to find out whether group information management tasks are governed by the same communication processes...
Emilee Rader
FOSSACS
2007
Springer
15 years 11 months ago
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
Matthew Hague, C.-H. Luke Ong
ICDCS
1997
IEEE
15 years 9 months ago
Group Communication Support for Distributed Multimedia and CSCW Systems
The Collaborative Computing Transport Layer (CCTL) is a communication substrate consisting of a suite of multiparty protocols, providing varying service qualities among process gr...
Injong Rhee, Shun Yan Cheung, Phillip W. Hutto, Va...
PODC
1997
ACM
15 years 9 months ago
Determining Consensus Numbers
Conditions on a shared object type T are given that are both necessary and sufficient for wait-free n-process consensus to be solvable using objects of type T and registers. The co...
Eric Ruppert