Sciweavers

3328 search results - page 150 / 666
» On Plateaued Functions and Their Constructions
Sort
View
LICS
2012
IEEE
13 years 9 months ago
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
Serge Haddad, Sylvain Schmitz, Philippe Schnoebele...
VLDB
1995
ACM
97views Database» more  VLDB 1995»
15 years 10 months ago
Similarity based Retrieval of Pictures Using Indices on Spatial Relationships
The paper presents (i) two similarity based methods for retrieval of pictures using indices on spatial relationships; (ii) efficient algorithms for the deduction and reduction of ...
A. Prasad Sistla, Clement T. Yu, Chengwen Liu, Kin...
UAI
1994
15 years 7 months ago
Belief Induced by the Partial Knowledge of the Probabilities
: We construct the belief function that quantifies the agent' beliefs about which event of will occurred when he knows that the event is selected by a chance set-up and that ...
Philippe Smets
ICFP
2004
ACM
16 years 6 months ago
Generics for the masses
A generic function is a function that can be instantiated on many data types to obtain data type specific functionality. Examples of generic functions are the functions that can b...
Ralf Hinze
ICRA
1994
IEEE
102views Robotics» more  ICRA 1994»
15 years 10 months ago
Sensor-Based Planning and Nonsmooth Analysis
This paper describes some initial steps towards sensor based path planning in an unknown static environment. The method is a based on a sensor-based incremental construction of a o...
Howie Choset, Joel W. Burdick