Sciweavers

980 search results - page 123 / 196
» On Negative Bases
Sort
View
COCO
2003
Springer
145views Algorithms» more  COCO 2003»
14 years 2 months ago
Hardness vs. Randomness within Alternating Time
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
Emanuele Viola
AAAI
2008
13 years 11 months ago
On the Progression of Situation Calculus Basic Action Theories: Resolving a 10-year-old Conjecture
In a seminal paper, Lin and Reiter introduced a modeltheoretic definition for the progression of the initial knowledge base of a basic action theory. This definition comes with a ...
Stavros Vassos, Hector J. Levesque
WWW
2007
ACM
14 years 9 months ago
From SPARQL to rules (and back)
As the data and ontology layers of the Semantic Web stack have achieved a certain level of maturity in standard recommendations such as RDF and OWL, the current focus lies on two ...
Axel Polleres
IJFCS
2006
111views more  IJFCS 2006»
13 years 9 months ago
Completeness and realizability: conditions for automatic generation of workflows
In recent years, workflow technology has greatly facilitated business process modeling and reengineering in information systems. On one hand, the separation of an application'...
Shiyong Lu, Arthur J. Bernstein, Philip M. Lewis
CVPR
2001
IEEE
14 years 11 months ago
Learning Similarity Measure for Natural Image Retrieval with Relevance Feedback
A new scheme of learning similarity measure is proposed for content-based image retrieval (CBIR). It learns a boundary that separates the images in the database into two parts. Im...
Guodong Guo, Anil K. Jain, Wei-Ying Ma, HongJiang ...