Sciweavers

2370 search results - page 36 / 474
» A Structured Set of Higher-Order Problems
Sort
View
COMPGEOM
2009
ACM
14 years 3 months ago
Near-linear approximation algorithms for geometric hitting sets
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
Pankaj K. Agarwal, Esther Ezra, Micha Sharir
DEXA
2007
Springer
135views Database» more  DEXA 2007»
14 years 3 months 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»
14 years 1 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
CVPR
2008
IEEE
14 years 11 months ago
Generalised blurring mean-shift algorithms for nonparametric clustering
Gaussian blurring mean-shift (GBMS) is a nonparametric clustering algorithm, having a single bandwidth parameter that controls the number of clusters. The algorithm iteratively sh...
Miguel Á. Carreira-Perpiñán
BMCBI
2010
163views more  BMCBI 2010»
13 years 9 months ago
Reduced representation of protein structure: implications on efficiency and scope of detection of structural similarity
Background: Computational comparison of two protein structures is the starting point of many methods that build on existing knowledge, such as structure modeling (including modeli...
Zong Hong Zhang, Hwee Kuan Lee, Ivana Mihalek