Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
385
Query Evaluation with Constant Delay
"... I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available for dis ..."
Abstract
- Add to MetaCart
I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available
First steps in programming: A rationale for attention investment models.
- In Proc. HCC, IEEE
, 2002
"... Abstract Research into the cognitive aspects of programming originated in the study of professional programmers (whether experts or students). Even "end-user" programmers What is Programming? Goodell's excellent website devoted to end user programming Programming is in fact seld ..."
Abstract
-
Cited by 110 (16 self)
- Add to MetaCart
;spadework" of finding a precise mathematical formulation and method of solution, possibly notated in a "convenient problem-oriented language" whose symbols are "more closely related to the mathematical problem to be solved". The major changes since this was written are a) that many computer users do
Good Questions, Dubious Inferences, and Bad Solutions: Some Further Thoughts on Satisfaction with Democracy. Working Paper
, 2005
"... I evaluate claims made in a recent paper, which challenges the validity of the widely-used Satisfaction with Democracy (SWD) indicator (Canache, Mondak, and Seligson 2001). I argue that the study falls short because the evidence presented in the paper does not actually nor necessarily lead to the in ..."
Abstract
-
Cited by 7 (1 self)
- Add to MetaCart
. I argue that the paper does not make a very strong case against the measure, tells us little we do not already know, and does not seek to advance our theoretical understanding of political support. Maybe most importantly, it does not offer a solution to the problems it purports to identify. I also
On zero error algorithms having oracle access to one query
- Journal of Combinatorial Optimization
"... Abstract It is known that Sp2 ` ZPPNP [3]. The reverse direction of whether ZPPNP is contained inS p 2 remains open. We show that if the zero-error algorithm is allowed to ask only one queryto the NP oracle (for any input and random string), then it can be simulated in Sp 2. That is,we prove that ZP ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
Abstract It is known that Sp2 ` ZPPNP [3]. The reverse direction of whether ZPPNP is contained inS p 2 remains open. We show that if the zero-error algorithm is allowed to ask only one queryto the NP oracle (for any input and random string), then it can be simulated in Sp 2. That is,we prove
A bad 2-dimensional instance for k-means++
"... Abstract. The k-means++ seeding algorithm is one of the most popular algorithms that is used for finding the initial k centers when using the k-means heuristic. The algorithm is a simple sampling procedure and can be described as follows: Pick the first center randomly from among the given points. F ..."
Abstract
- Add to MetaCart
11] gave a dataset where the k-means++ seeding algorithm achieves an approximation ratio of (2/3 − ) · log k only with probability that is exponentially small in k. However, this and all other known lower-bound examples [AV07,ADK09] are high dimensional. So, an open problem is to understand
Quantitative Analysis of Consensus Algorithms
"... Abstract—Consensus is one of the key problems in fault-tolerant distributed computing. Although the solvability of consensus is now a well-understood problem, comparing different algorithms in terms of efficiency is still an open problem. In this paper, we address this question for round-based conse ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
Abstract—Consensus is one of the key problems in fault-tolerant distributed computing. Although the solvability of consensus is now a well-understood problem, comparing different algorithms in terms of efficiency is still an open problem. In this paper, we address this question for round
The BKZ Simulation Algorithm
"... Hiermit versichere ich, die vorliegende Bachelor-Thesis ohne Hilfe Dritter nur mit den angegebenen Quellen und Hilfsmitteln angefertigt zu haben. Alle Stellen, die aus Quellen entnommen wurden, sind als solche kenntlich gemacht. Diese Arbeit hat in gleicher oder ähnlicher Form noch keiner Prüfungsbe ..."
Abstract
- Add to MetaCart
Prüfungsbehörde vorgelegen. Darmstadt, den 08. 07. 2013 (Tobias Hamann) The best reduction algorithm for lattices with high dimensions known today is the BKZ reduction algorithm by Schnorr and Euchner. The running time of the BKZ reduction algorithm, however, increases significantly with higher blocksizes
Using views to generate efficient evaluation plans for queries
, 2007
"... We study the problem of generating efficient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialized from base relations, rather than views describing sources in terms of abstract predicates, as is common when the open ..."
Abstract
-
Cited by 4 (3 self)
- Add to MetaCart
We study the problem of generating efficient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialized from base relations, rather than views describing sources in terms of abstract predicates, as is common when
Credit Card Fraud Detection with a Neural-Network,”
- Proc. 27th Hawaii Int‟l Conf. System Sciences: Information Systems: Decision Support and Knowledge-Based Systems,
, 1994
"... Abstract Using data from a credit card issuer, a neural network based fraud detection system was trained on a large sample of labelled credit card account transactions and tested on a holdout data set that consisted of all account activity over a subsequent two-month period of time. The neural netw ..."
Abstract
-
Cited by 74 (0 self)
- Add to MetaCart
of the fraud problem grew from 8 basis points to over 20. Although credit card fraud takes many forms, there are several principal categories. Fraud due to lost cards and stolen cards generally accounts for a certain "base level" of fraud activity. The size of this base level can be affected
Results 1 - 10
of
385
