Sciweavers

917 search results - page 150 / 184
» Comparison of Data Structures for Computing Formal Concepts
Sort
View
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
15 years 4 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch
PODC
2005
ACM
15 years 3 months ago
Distance estimation and object location via rings of neighbors
We consider four problems on distance estimation and object location which share the common flavor of capturing global information via informative node labels: low-stretch routin...
Aleksandrs Slivkins
IJVR
2008
111views more  IJVR 2008»
14 years 9 months ago
Improve a Game Board based on Cultural Algorithms
Evolutionary computation is a generic term used to make reference to the solution of computational problems planned and implemented based on models of an evolutionary process. Most...
Alberto Ochoa, Alejandro Padilla, Saúl Gonz...
ICCV
2011
IEEE
13 years 9 months ago
Modeling Temporal Coherence for Optical Flow
Despite the fact that temporal coherence is undeniably one of the key aspects when processing video data, this concept has hardly been exploited in recent optical flow methods. I...
Sebastian Volz, Andres Bruhn, Levi Valgaerts, Henn...
JLP
2007
89views more  JLP 2007»
14 years 9 months ago
Universality and semicomputability for nondeterministic programming languages over abstract algebras
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
Wei Jiang, Yuan Wang, Jeffery I. Zucker