Sciweavers

5022 search results - page 1002 / 1005
» Data structures and problem solving using Java
Sort
View
VLDB
1997
ACM
97views Database» more  VLDB 1997»
15 years 1 months ago
The Complexity of Transformation-Based Join Enumeration
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
Arjan Pellenkoft, César A. Galindo-Legaria,...
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 1 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
CONCUR
2000
Springer
15 years 1 months ago
Reachability Analysis for Some Models of Infinite-State Transition Systems
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...
Oscar H. Ibarra, Tevfik Bultan, Jianwen Su
SBIA
1995
Springer
15 years 1 months ago
Modeling the Influence of Non-Changing Quantities
ion Framework for Compositional Modeling 36 Diane Chi and Yumi Iwasaki Model Decomposition and Simulation 45 Daniel J. Clancy and Benjamin Kuipers A Distance Measure for Attention ...
Bert Bredeweg, Kees de Koning, Cis Schut
DGO
2006
134views Education» more  DGO 2006»
14 years 11 months ago
Next steps in near-duplicate detection for eRulemaking
Large volume public comment campaigns and web portals that encourage the public to customize form letters produce many near-duplicate documents, which increases processing and sto...
Hui Yang, Jamie Callan, Stuart W. Shulman
« Prev « First page 1002 / 1005 Last » Next »