Sciweavers

2434 search results - page 272 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
SMA
2005
ACM
167views Solid Modeling» more  SMA 2005»
15 years 9 months ago
Boolean operations on 3D selective Nef complexes: optimized implementation and experiments
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
Peter Hachenberger, Lutz Kettner
SIAMADS
2010
63views more  SIAMADS 2010»
14 years 10 months ago
Time Integration and Steady-State Continuation for 2d Lubrication Equations
Lubrication equations describe many structuring processes of thin liquid films. We develop and apply a numerical framework suitable for their analysis employing a dynamical systems...
Philippe Beltrame, Uwe Thiele
ISCI
2007
130views more  ISCI 2007»
15 years 3 months ago
Learning to classify e-mail
In this paper we study supervised and semi-supervised classification of e-mails. We consider two tasks: filing e-mails into folders and spam e-mail filtering. Firstly, in a sup...
Irena Koprinska, Josiah Poon, James Clark, Jason C...
153
Voted
KDD
2007
ACM
151views Data Mining» more  KDD 2007»
16 years 4 months ago
Efficient mining of iterative patterns for software specification discovery
Studies have shown that program comprehension takes up to 45% of software development costs. Such high costs are caused by the lack-of documented specification and further aggrava...
Chao Liu 0001, David Lo, Siau-Cheng Khoo
169
Voted
ISAAC
2007
Springer
118views Algorithms» more  ISAAC 2007»
15 years 10 months ago
Dynamic Structures for Top- k Queries on Uncertain Data
In an uncertain data set S = (S, p, f) where S is the ground set consisting of n elements, p : S → [0, 1] a probability function, and f : S → R a score function, each element i...
Jiang Chen, Ke Yi