Sciweavers

855 search results - page 129 / 171
» Complexity of Equations over Sets of Natural Numbers
Sort
View
CVPR
2012
IEEE
13 years 13 days ago
On multiple foreground cosegmentation
In this paper, we address a challenging image segmentation problem called multiple foreground cosegmentation (MFC), which concerns a realistic scenario in general Webuser photo se...
Gunhee Kim, Eric P. Xing
CVPR
2006
IEEE
16 years 23 hour ago
Acceleration Strategies for Gaussian Mean-Shift Image Segmentation
Gaussian mean-shift (GMS) is a clustering algorithm that has been shown to produce good image segmentations (where each pixel is represented as a feature vector with spatial and r...
Miguel Á. Carreira-Perpiñán
SIGMOD
2007
ACM
146views Database» more  SIGMOD 2007»
15 years 10 months ago
Distributed query evaluation with performance guarantees
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
Gao Cong, Wenfei Fan, Anastasios Kementsietsidis
CI
2000
114views more  CI 2000»
14 years 9 months ago
A Guided Tour through Some Extensions of the Event Calculus
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
FSTTCS
1993
Springer
15 years 2 months ago
Induce-Statements and Induce-Expressions: Constructs for Inductive Programming
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
Theodore S. Norvell