Sciweavers

4745 search results - page 269 / 949
» Discretization: An Enabling Technique
Sort
View
COMPGEOM
2004
ACM
16 years 1 days ago
On empty convex polygons in a planar point set
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
Rom Pinchasi, Rados Radoicic, Micha Sharir
APN
2003
Springer
15 years 12 months ago
On Reachability in Autonomous Continuous Petri Net Systems
Fluidification is a common relaxation technique used to deal in a more friendly way with large discrete event dynamic systems. In Petri nets, fluidification leads to continuous ...
Jorge Júlvez, Laura Recalde, Manuel Silva
IEAAIE
2003
Springer
15 years 11 months ago
Fast Feature Selection by Means of Projections
The attribute selection techniques for supervised learning, used in the preprocessing phase to emphasize the most relevant attributes, allow making models of classification simple...
Roberto Ruiz, José Cristóbal Riquelm...
ICIP
2002
IEEE
15 years 11 months ago
Wavelet coding of volumetric medical datasets
—Several techniques based on the three–dimensional (3-D) discrete cosine transform (DCT) have been proposed for volumetric data coding. These techniques fail to provide lossles...
Adrian Munteanu, Peter Schelkens, Jan Cornelis
ICRA
2002
IEEE
92views Robotics» more  ICRA 2002»
15 years 11 months ago
Resolution Complete Rapidly-Exploring Random Trees
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
Peng Cheng, Steven M. LaValle