Sciweavers

328 search results - page 19 / 66
» Deterministic k-set structure
Sort
View
IJON
2008
156views more  IJON 2008»
13 years 7 months ago
Structural identifiability of generalized constraint neural network models for nonlinear regression
Identifiability becomes an essential requirement for learning machines when the models contain physically interpretable parameters. This paper presents two approaches to examining...
Shuang-Hong Yang, Bao-Gang Hu, Paul-Henry Courn&eg...
EVOW
2004
Springer
14 years 22 days ago
On the Structure of Sequential Search: Beyond "No Free Lunch"
In sequential, deterministic, non-redundant search the algorithm permutes a test function to obtain the search result. The mapping from test functions to search results is a one-to...
Thomas M. English
ICDE
2006
IEEE
183views Database» more  ICDE 2006»
14 years 1 months ago
Similarity Queries on Structured Data in Structured Overlays
Structured P2P systems based on distributed hash tables are a popular choice for building large-scaled data management systems. Generally, they only support exact match queries, b...
Marcel Karnstedt, Kai-Uwe Sattler, Manfred Hauswir...
FOCS
2005
IEEE
14 years 28 days ago
Linear Lower Bounds on Real-World Implementations of Concurrent Objects
This paper proves   ¡ £ ¥ lower bounds on the time to perform a single instance of an operation in any implementation of a large class of data structures shared by £ processe...
Faith Ellen Fich, Danny Hendler, Nir Shavit
FCT
2005
Springer
14 years 23 days ago
On the Black-Box Complexity of Sperner's Lemma
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...