Sciweavers

996 search results - page 178 / 200
» Partial Materialized Views
Sort
View
99
Voted
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
15 years 1 months ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio
CAV
2000
Springer
187views Hardware» more  CAV 2000»
15 years 1 months ago
Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking
In this paper we show how to do symbolic model checking using Boolean Expression Diagrams (BEDs), a non-canonical representation for Boolean formulas, instead of Binary Decision Di...
Poul Frederick Williams, Armin Biere, Edmund M. Cl...
VLDB
1987
ACM
92views Database» more  VLDB 1987»
15 years 1 months ago
Mind Your Grammar: a New Approach to Modelling Text
Beginning to create the New Oxford English Dictionary database has resulted in the realization that databases for reference texts are unlike those for conventional enterprises. Wh...
Gaston H. Gonnet, Frank Wm. Tompa
ATAL
2008
Springer
14 years 11 months ago
Using organization knowledge to improve routing performance in wireless multi-agent networks
Multi-agent systems benefit greatly from an organization design that guides agents in determining when to communicate, how often, with whom, with what priority, and so on. However...
Huzaifa Zafar, Victor R. Lesser, Daniel D. Corkill...
88
Voted
ASPLOS
2006
ACM
14 years 11 months ago
Tradeoffs in fine-grained heap memory protection
Different uses of memory protection schemes have different needs in terms of granularity. For example, heap security can benefit from chunk separation (by using protected "pa...
Jianli Shen, Guru Venkataramani, Milos Prvulovic