Sciweavers

709 search results - page 51 / 142
» In-stroke word completion
Sort
View
LICS
2000
IEEE
15 years 4 months ago
Computational Complexity of Some Problems Involving Congruences on Algebras
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
Clifford Bergman, Giora Slutzki
PDIS
1994
IEEE
15 years 4 months ago
A Predicate-based Caching Scheme for Client-Server Database Architectures
We propose a new client-side data-caching scheme for relational databases with a central server and multiple clients. Data are loaded into each client cache based on queries execut...
Arthur M. Keller, Julie Basu
COCO
1989
Springer
97views Algorithms» more  COCO 1989»
15 years 3 months ago
On the Structure of Bounded Queries to Arbitrary NP Sets
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...
Richard Chang
DASFAA
2007
IEEE
148views Database» more  DASFAA 2007»
15 years 3 months ago
An Efficient Encoding and Labeling for Dynamic XML Data
In order to efficiently determine structural relationships among XML elements and to avoid re-labeling for updates, much research about labeling schemes has been conducted, recentl...
Jun-Ki Min, Jihyun Lee, Chin-Wan Chung
CORR
2010
Springer
168views Education» more  CORR 2010»
14 years 12 months ago
Penalty Decomposition Methods for Rank Minimization
In this paper we consider general rank minimization problems with rank appearing in either objective function or constraint. We first show that a class of matrix optimization prob...
Zhaosong Lu, Yong Zhang