Sciweavers

611 search results - page 99 / 123
» Index Sets of Computable Structures with Decidable Theories
Sort
View
PODS
2009
ACM
113views Database» more  PODS 2009»
14 years 9 months ago
Relative information completeness
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
Wenfei Fan, Floris Geerts
HICSS
2003
IEEE
146views Biometrics» more  HICSS 2003»
14 years 2 months ago
A Model for the Emergence and Diffusion of Software Standards
The economic impact of the growth dynamic of standards is often described from a macroeconomic point of view, employing network effect theory and models dealing with externalities...
Tim Stockheim, Michael Schwind, Wolfgang Köni...
SIGMOD
2009
ACM
258views Database» more  SIGMOD 2009»
14 years 9 months ago
Continuous obstructed nearest neighbor queries in spatial databases
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
Yunjun Gao, Baihua Zheng
MLG
2007
Springer
14 years 3 months ago
A Universal Kernel for Learning Regular Languages
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
Leonid Kontorovich
SIGECOM
2006
ACM
139views ECommerce» more  SIGECOM 2006»
14 years 3 months ago
Playing games in many possible worlds
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
Matt Lepinski, David Liben-Nowell, Seth Gilbert, A...