Sciweavers

3092 search results - page 94 / 619
» Where are you pointing
Sort
View
KDD
2012
ACM
181views Data Mining» more  KDD 2012»
12 years 1 months ago
On "one of the few" objects
Objects with multiple numeric attributes can be compared within any “subspace” (subset of attributes). In applications such as computational journalism, users are interested i...
You Wu, Pankaj K. Agarwal, Chengkai Li, Jun Yang 0...
IDA
2002
Springer
13 years 11 months ago
Classification with sparse grids using simplicial basis functions
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
Jochen Garcke, Michael Griebel
CAGD
2010
125views more  CAGD 2010»
13 years 8 months ago
Precise Hausdorff distance computation between polygonal meshes
We present an exact algorithm for computing the precise Hausdorff distance between two general polyhedra represented as triangular meshes. The locus of candidate points, events wh...
Michael Barton, Iddo Hanniel, Gershon Elber, Myung...
VLSID
2006
IEEE
112views VLSI» more  VLSID 2006»
14 years 5 months ago
Handling Constraints in Multi-Objective GA for Embedded System Design
Design space exploration is central to embedded system design. Typically this is a multi-objective search problem, where performance, power, area etc. are the different optimizati...
Biman Chakraborty, Ting Chen, Tulika Mitra, Abhik ...
COMPGEOM
2007
ACM
14 years 3 months ago
Streaming algorithms for line simplification
We study the following variant of the well-known line-simplification problem: we are getting a possibly infinite sequence of points p0, p1, p2, . . . in the plane defining a polyg...
Mohammad Ali Abam, Mark de Berg, Peter Hachenberge...