Sciweavers

953 search results - page 91 / 191
» Efficient Evaluation of Large Polynomials
Sort
View
VLDB
1993
ACM
121views Database» more  VLDB 1993»
14 years 1 days ago
Integrity Constraint and Rule Maintenance in Temporal Deductive Knowledge Bases
The enforcement of semantic integrity constraints in data and knowledge bases constitutea a major performance bottleneck. Integrity constraint simplification methods aim at reduci...
Dimitris Plexousakis
ASPDAC
2009
ACM
109views Hardware» more  ASPDAC 2009»
13 years 9 months ago
Soft lists: a native index structure for NOR-flash-based embedded devices
Efficient data indexing is significant to embedded devices, because both CPU cycles and energy are very precious resources. Soft lists, a new index structure for embedded devices w...
Li-Pin Chang, Chen-Hui Hsu
ICDE
1998
IEEE
163views Database» more  ICDE 1998»
14 years 9 months ago
Fast Nearest Neighbor Search in High-Dimensional Space
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, H...
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
14 years 8 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
KDD
2002
ACM
150views Data Mining» more  KDD 2002»
14 years 8 months ago
Querying multiple sets of discovered rules
Rule mining is an important data mining task that has been applied to numerous real-world applications. Often a rule mining system generates a large number of rules and only a sma...
Alexander Tuzhilin, Bing Liu