Sciweavers

7228 search results - page 622 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
SIGMOD
2000
ACM
141views Database» more  SIGMOD 2000»
15 years 11 months ago
Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer
Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects oft...
Florian Waas, César A. Galindo-Legaria
STOC
1998
ACM
125views Algorithms» more  STOC 1998»
15 years 11 months ago
Spot-Checkers
On Labor Day weekend, the highway patrol sets up spot-checks at random points on the freeways with the intention of deterring a large fraction of motorists from driving incorrectl...
Funda Ergün, Sampath Kannan, Ravi Kumar, Roni...
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
15 years 11 months ago
Efficient Reorganization of Binary Search Trees
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
Micha Hofri, Hadas Shachnai
IJCAI
2007
15 years 8 months ago
Simple Training of Dependency Parsers via Structured Boosting
Recently, significant progress has been made on learning structured predictors via coordinated training algorithms such as conditional random fields and maximum margin Markov ne...
Qin Iris Wang, Dekang Lin, Dale Schuurmans
NETWORKING
2008
15 years 8 months ago
Cooperative Replication in Content Networks with Nodes under Churn
In content networks, a replication group refers to a set of nodes that cooperate with each other to retrieve information objects from a distant server. Each node locally replicates...
Eva Jaho, Ioannis Z. Koukoutsidis, Ioannis Stavrak...