Sciweavers

873 search results - page 114 / 175
» Updates and View Maintenance
Sort
View
UC
2005
Springer
14 years 2 months ago
On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
Predrag T. Tosic, Gul A. Agha
SIGMOD
1997
ACM
107views Database» more  SIGMOD 1997»
14 years 27 days ago
Picture Programming Project
Visual Language (VL) system development is getting increasingly sophisticated in part due to the arduous nature of user interface (UI) code development. This typically involves id...
Nita Goyal, Charles Hoch, Ravi Krishnamurthy, Bria...
BIRTHDAY
2007
Springer
14 years 21 days ago
Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms
Abstract. The Operational Transformation (OT) approach is a technique for supporting optimistic replication in collaborative and mobile systems. It allows the users to concurrently...
Abdessamad Imine, Michaël Rusinowitch
ICSE
1995
IEEE-ACM
14 years 8 days ago
A Framework for Selective Recompilation in the Presence of Complex Intermodule Dependencies
Compilers and other programming environment tools derive information from the source code of programs; derived information includes compiled code, interprocedural summary informat...
Craig Chambers, Jeffrey Dean, David Grove
NIPS
2004
13 years 10 months ago
Incremental Learning for Visual Tracking
Most existing tracking algorithms construct a representation of a target object prior to the tracking task starts, and utilize invariant features to handle appearance variation of...
Jongwoo Lim, David A. Ross, Ruei-Sung Lin, Ming-Hs...