Sciweavers

11740 search results - page 82 / 2348
» More Problems in Rewriting
Sort
View
VLDB
2005
ACM
105views Database» more  VLDB 2005»
15 years 6 months ago
Light-weight Domain-based Form Assistant: Querying Web Databases On the Fly
The Web has been rapidly “deepened” by myriad searchable databases online, where data are hidden behind query forms. Helping users query alternative “deep Web” sources in ...
Zhen Zhang, Bin He, Kevin Chen-Chuan Chang
109
Voted
ICDCS
1999
IEEE
15 years 5 months ago
Incorporating Transaction Semantics to Reduce Reprocessing Overhead in Replicated Mobile Data Applications
Update anywhere-anytime-anyway transactional replication has unstable behavior as the workload scales up. To reduce this problem, a two-tier replication algorithm is proposed in [...
Peng Liu, Paul Ammann, Sushil Jajodia
107
Voted
JCS
2008
109views more  JCS 2008»
15 years 19 days ago
Secrecy for bounded security protocols with freshness check is NEXPTIME-complete
The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. In this paper, the (initial) secrecy problem for bound...
Ferucio Laurentiu Tiplea, Catalin V. Birjoveanu, C...
187
Voted
SIGCSE
2002
ACM
328views Education» more  SIGCSE 2002»
15 years 9 days ago
Graphical problem solving and visual communication in the beginning computer graphics course
The beginning computer graphics course can teach much more than just computer graphics. It can also provide an
Steve Cunningham
108
Voted
CADE
2006
Springer
16 years 29 days ago
Tree Automata with Equality Constraints Modulo Equational Theories
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
Florent Jacquemard, Laurent Vigneron, Michaël...