Sciweavers

70 search results - page 14 / 14
» Distributed Language Modeling for N-best List Re-ranking
Sort
View
GIS
2005
ACM
14 years 6 months ago
Supporting uncertainty in moving objects in network databases
The management of moving objects has been intensively studied in the recent years. A wide and increasing range of database applications has to deal with spatial objects whose posi...
Ralf Hartmut Güting, Victor Teixeira de Almei...
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 5 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
COMPGEOM
2006
ACM
13 years 11 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
ERCIMDL
2009
Springer
177views Education» more  ERCIMDL 2009»
13 years 10 months ago
Curated Databases
Curated databases are databases that are populated and updated with a great deal of human effort. Most reference works that one traditionally found on the reference shelves of li...
Peter Buneman
KDD
2009
ACM
204views Data Mining» more  KDD 2009»
14 years 5 months ago
Improving classification accuracy using automatically extracted training data
Classification is a core task in knowledge discovery and data mining, and there has been substantial research effort in developing sophisticated classification models. In a parall...
Ariel Fuxman, Anitha Kannan, Andrew B. Goldberg, R...