Sciweavers

1969 search results - page 167 / 394
» Financial Theory 1
Sort
View
CIKM
2003
Springer
15 years 11 months ago
Operational requirements for scalable search systems
Prior research into search system scalability has primarily addressed query processing efficiency [1, 2, 3] or indexing efficiency [3], or has presented some arbitrary system arch...
Abdur Chowdhury, Greg Pass
UML
2001
Springer
15 years 11 months ago
Representing Embedded System Sequence Diagrams as a Formal Language
Sequence Diagrams (SDs) have proven useful for describing transaction-oriented systems, and can form a basis for creating statecharts. However, distributed embedded systems require...
Elizabeth Latronico, Philip Koopman
ICDT
2010
ACM
125views Database» more  ICDT 2010»
15 years 10 months ago
Synthesizing View Definitions from Data
Given a database instance and a corresponding view instance, we address the view definitions problem (VDP): Find the most succinct and accurate view definition, when the view quer...
Anish Das Sarma, Aditya Parameswaran, Hector Garci...
COCO
1994
Springer
100views Algorithms» more  COCO 1994»
15 years 10 months ago
Relative to a Random Oracle, NP is Not Small
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
Steven M. Kautz, Peter Bro Miltersen
ATAL
2006
Springer
15 years 10 months ago
Learning to identify winning coalitions in the PAC model
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...
Ariel D. Procaccia, Jeffrey S. Rosenschein