Sciweavers

6597 search results - page 87 / 1320
» Orderings and Types in Databases
Sort
View
AAAI
2011
12 years 9 months ago
Coarse-to-Fine Inference and Learning for First-Order Probabilistic Models
Coarse-to-fine approaches use sequences of increasingly fine approximations to control the complexity of inference and learning. These techniques are often used in NLP and visio...
Chloe Kiddon, Pedro Domingos
LREC
2008
132views Education» more  LREC 2008»
13 years 10 months ago
From Human Communication to Intelligent User Interfaces: Corpora of Spoken Estonian
We argue for the necessity of studying human-human spoken conversations of various kinds in order to create user interfaces to databases. An efficient user interface benefits from...
Tiit Hennoste, Olga Gerassimenko, Riina Kasterpalu...
DKE
2006
123views more  DKE 2006»
13 years 9 months ago
Cost models for distance joins queries using R-trees
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
TKDE
2011
363views more  TKDE 2011»
13 years 4 months ago
Efficient Techniques for Online Record Linkage
—The need to consolidate the information contained in heterogeneous data sources has been widely documented in recent years. In order to accomplish this goal, an organization mus...
Debabrata Dey, Vijay S. Mookerjee, Dengpan Liu
CIE
2010
Springer
14 years 1 months ago
Higher-Order Containers
Containers are a semantic way to talk about strictly positive types. In previous work it was shown that containers are closed under various constructions including products, coprod...
Thorsten Altenkirch, Paul Levy, Sam Staton