Sciweavers

304 search results - page 23 / 61
» Computational Experience with the Batch Means Method
Sort
View
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
15 years 6 months ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey...
CVPR
2012
IEEE
13 years 9 months ago
Online robust image alignment via iterative convex optimization
In this paper we study the problem of online aligning a newly arrived image to previously well-aligned images. Inspired by recent advances in batch image alignment using low rank ...
Yi Wu, Bin Shen, Haibin Ling
SIGMOD
2005
ACM
109views Database» more  SIGMOD 2005»
16 years 6 months ago
Query-Sensitive Embeddings
A common problem in many types of databases is retrieving the most similar matches to a query object. Finding those matches in a large database can be too slow to be practical, es...
Vassilis Athitsos, Marios Hadjieleftheriou, George...
ACL
2009
15 years 4 months ago
A Syntax-Free Approach to Japanese Sentence Compression
Conventional sentence compression methods employ a syntactic parser to compress a sentence without changing its meaning. However, the reference compressions made by humans do not ...
Tsutomu Hirao, Jun Suzuki, Hideki Isozaki
EPIA
2005
Springer
16 years 4 days ago
Adapting Peepholing to Regression Trees
This paper presents an adaptation of the peepholing method to regression trees. Peepholing was described as a means to overcome the major computational bottleneck of growing classi...
Luís Torgo, Joana Marques