Sciweavers

10608 search results - page 566 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
COMPGEOM
1995
ACM
15 years 10 months ago
A New Technique for Analyzing Substructures in Arrangements
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
Boaz Tagansky
CORR
2008
Springer
137views Education» more  CORR 2008»
15 years 9 months ago
Communications in cellular automata
The goal of this paper is to show why the framework of communication complexity seems suitable for the study of cellular automata. Researchers have tackled different algorithmic p...
Eric Goles Ch., Pierre-Etienne Meunier, Ivan Rapap...
EMNLP
2008
15 years 8 months ago
Understanding the Value of Features for Coreference Resolution
In recent years there has been substantial work on the important problem of coreference resolution, most of which has concentrated on the development of new models and algorithmic...
Eric Bengtson, Dan Roth
SIMUTOOLS
2008
15 years 8 months ago
SIMCAN: a SIMulator framework for computer architectures and storage networks
This paper presents an OMNeT-based Framework to simulate large complex storage networks, with its corresponding underlying subsystems (I/O, Networking, etc.). With this Framework,...
Alberto Nuñez, Javier Fernández, Jos...
TPDS
2008
76views more  TPDS 2008»
15 years 7 months ago
How to Choose a Timing Model
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
Idit Keidar, Alexander Shraer