Sciweavers

359 search results - page 62 / 72
» On the number of chord diagrams
Sort
View
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
13 years 10 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
13 years 8 months ago
Superstate identification for state machines using search-based clustering
State machines are a popular method of representing a syshigh level of abstraction that enables developers to gain an overview of the system they represent and quickly understand ...
Mathew Hall, Phil McMinn, Neil Walkinshaw
IJON
2007
132views more  IJON 2007»
13 years 8 months ago
Emergence of population synchrony in a layered network of the cat visual cortex
Recently, a quantitative wiring diagram for the local neuronal network of cat visual cortex was described [T. Binzegger, R.J. Douglas, K.A.C. Martin, A quantitative map of the cir...
Jens Kremkow, Arvind Kumar, Stefan Rotter, Ad Aert...
TCOM
2008
131views more  TCOM 2008»
13 years 8 months ago
Accurate estimation of the Hurst parameter of long-range dependent traffic using modified Allan and Hadamard variances
Abstract--Internet traffic exhibits self-similarity and longrange dependence (LRD) on various time scales. In this paper, we propose to use the Modified Allan Variance (MAVAR) and ...
Stefano Bregni, Luca Jmoda
ISCI
2007
103views more  ISCI 2007»
13 years 8 months ago
Threshold-based declustering
Declustering techniques reduce query response time through parallel I/O by distributing data among multiple devices. Except for a few cases it is not possible to find declusterin...
Ali Saman Tosun