Sciweavers

15073 search results - page 286 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
ECCV
2010
Springer
15 years 4 months ago
Object Recognition with Hierarchical Stel Models
Abstract. We propose a new generative model, and a new image similarity kernel based on a linked hierarchy of probabilistic segmentations. The model is used to efficiently segment ...
Alessandro Perina, Nebojsa Jojic, Umberto Castella...
141
Voted
ACL
2012
13 years 7 months ago
Labeling Documents with Timestamps: Learning from their Time Expressions
Temporal reasoners for document understanding typically assume that a document’s creation date is known. Algorithms to ground relative time expressions and order events often re...
Nathanael Chambers
138
Voted
WOB
2003
140views Bioinformatics» more  WOB 2003»
15 years 6 months ago
Computing Maximum Subsequence in Parallel
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
Carlos E. R. Alves, Edson Cáceres, Siang W....
PVLDB
2010
135views more  PVLDB 2010»
14 years 11 months ago
QSkycube: Efficient Skycube Computation using Point-Based Space Partitioning
Skyline queries have gained considerable attention for multicriteria analysis of large-scale datasets. However, the skyline queries are known to return too many results for highdi...
Jongwuk Lee, Seung-won Hwang
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
15 years 6 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan