Sciweavers

10997 search results - page 179 / 2200
» On the Structure of Complete Sets
Sort
View
COMGEO
2006
ACM
15 years 6 months ago
A new algorithmic approach to the computation of Minkowski functionals of polyconvex sets
An algorithm is proposed for the simultaneous computation of all Minkowski functionals (except for the volume) of sets from the convex ring in Rd discretized with respect to a give...
Simone Klenk, Volker Schmidt, Evgueni Spodarev
GFKL
2004
Springer
137views Data Mining» more  GFKL 2004»
15 years 12 months ago
Density Estimation and Visualization for Data Containing Clusters of Unknown Structure
Abstract. A method for measuring the density of data sets that contain an unknown number of clusters of unknown sizes is proposed. This method, called Pareto Density Estimation (PD...
Alfred Ultsch
DEXA
2007
Springer
135views Database» more  DEXA 2007»
16 years 23 days ago
Semantic Grouping of Social Networks in P2P Database Settings
Abstract. Sharing of structured data in decentralized environments is a challenging problem, especially in the absence of a global schema. Social network structures map network lin...
Verena Kantere, Dimitrios Tsoumakos, Timos K. Sell...
VTS
2000
IEEE
94views Hardware» more  VTS 2000»
15 years 11 months ago
On Testing the Path Delay Faults of a Microprocessor Using its Instruction Set
1 This paper addresses the problem of testing path delay faults in a microprocessor using instructions. It is observed that a structurally testable path (i.e., a path testable thro...
Wei-Cheng Lai, Angela Krstic, Kwang-Ting Cheng
MICRO
1997
IEEE
141views Hardware» more  MICRO 1997»
15 years 10 months ago
Unroll-and-Jam Using Uniformly Generated Sets
Modern architectural trends in instruction-level parallelism (ILP) are to increase the computational power of microprocessors significantly. As a result, the demands on memory ha...
Steve Carr, Yiping Guan