Sciweavers

1034 search results - page 189 / 207
» Inference of field initialization
Sort
View
WEBDB
2010
Springer
178views Database» more  WEBDB 2010»
14 years 1 months ago
Using Latent-Structure to Detect Objects on the Web
An important requirement for emerging applications which aim to locate and integrate content distributed over the Web is to identify pages that are relevant for a given domain or ...
Luciano Barbosa, Juliana Freire
ICCV
1999
IEEE
14 years 23 days ago
Epipolar Geometry Estimation by Tensor Voting in 8D
We present a novel, efficient, initializationfree approach to the problem of epipolar geometry estimation, by formulating it as one of hyperplane inference from a sparse and noisy...
Chi-Keung Tang, Gérard G. Medioni, Mi-Suen ...
SPAA
1997
ACM
14 years 19 days ago
A Localized Algorithm for Parallel Association Mining
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, We...
TIME
1994
IEEE
14 years 17 days ago
An Algebraic Formulation of Temporal Knowledge for Reasoning about Recurring Events
We formulate an algebra of binary temporal relations between events the number of occurrences of which is unknown, but which are known to recur in time. Ontologically, we view the...
Robert A. Morris, William D. Shoaff, Lina Khatib
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
14 years 10 days ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...