Sciweavers

7522 search results - page 1362 / 1505
» Spacing memetic algorithms
Sort
View
LATIN
2004
Springer
16 years 10 days ago
Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
Given a finite set V , and integers k ≥ 1 and r ≥ 0, denote by A(k, r) the class of hypergraphs A ⊆ 2V with (k, r)-bounded intersections, i.e. in which the intersection of a...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
197
Voted
ICDM
2003
IEEE
92views Data Mining» more  ICDM 2003»
16 years 7 days ago
Validating and Refining Clusters via Visual Rendering
Clustering is an important technique for understanding and analysis of large multi-dimensional datasets in many scientific applications. Most of clustering research to date has be...
Keke Chen, Ling Liu
183
Voted
COMPGEOM
2003
ACM
16 years 6 days ago
Cache-oblivious data structures for orthogonal range searching
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan...
188
Voted
COMPGEOM
2003
ACM
16 years 6 days ago
Molecular shape analysis based upon the morse-smale complex and the connolly function
Docking is the process by which two or several molecules form a complex. Docking involves the geometry of the molecular surfaces, as well as chemical and energetical consideration...
Frédéric Cazals, Frédé...
PODS
2010
ACM
150views Database» more  PODS 2010»
16 years 1 days ago
Understanding queries in a search database system
It is well known that a search engine can significantly benefit from an auxiliary database, which can suggest interpretations of the search query by means of the involved concep...
Ronald Fagin, Benny Kimelfeld, Yunyao Li, Sriram R...
« Prev « First page 1362 / 1505 Last » Next »