Sciweavers

1819 search results - page 207 / 364
» Computability and Representations of the Zero Set
Sort
View
ANLP
1994
113views more  ANLP 1994»
15 years 7 months ago
Acquiring Knowledge From Encyclopedic Texts
A computational model for the acquisition of knowledge from encyclopedic texts is described. The model has been implemented in a program, called SNOWY, that reads unedited texts f...
Fernando Gomez, Richard D. Hull, Carlos Segami
CGF
2008
179views more  CGF 2008»
15 years 6 months ago
Sketching MLS Image Deformations On the GPU
In this paper, we present an image editing tool that allows the user to deform images using a sketch-based interface. The user simply sketches a set of source curves in the input ...
Yanlin Weng, Xiaohan Shi, Hujun Bao, Jun Zhang
IVC
2007
98views more  IVC 2007»
15 years 6 months ago
Reversible vectorisation of 3D digital planar curves and applications
This paper tackles the problem of the computation of a planar polygonal curve from a digital planar curve, such that the digital data can be exactly retrieved from the polygonal c...
Isabelle Sivignon, Florent Dupont, Jean-Marc Chass...
IDA
2002
Springer
15 years 6 months ago
Optimization of association rule mining queries
Levelwise algorithms (e.g., the Apriori algorithm) have been proved eective for association rule mining from sparse data. However, in many practical applications, the computation ...
Baptiste Jeudy, Jean-François Boulicaut
TCS
2010
15 years 4 months ago
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...