Sciweavers

3510 search results - page 270 / 702
» Searching with numbers
Sort
View
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
16 years 7 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen
VLSID
2000
IEEE
75views VLSI» more  VLSID 2000»
15 years 11 months ago
Timing Analysis with Implicitly Specified False Paths
We consider the problem of timing analysis in the presence of known false paths. The main difficulty in adaptation of classical breadth-first search to the problem is that at each...
Eugene Goldberg, Alexander Saldanha
IFSA
2007
Springer
110views Fuzzy Logic» more  IFSA 2007»
16 years 27 days ago
Selection Criteria for Fuzzy Unsupervised Learning: Applied to Market Segmentation
The use of unsupervised fuzzy learning methods produces a large number of alternative classifications. This paper presents and analyzes a series of criteria to select the most sui...
Germán Sánchez, Núria Agell, ...
KDD
1997
ACM
109views Data Mining» more  KDD 1997»
15 years 11 months ago
Selecting Features by Vertical Compactness of Data
Feature selection is a data preprocessing step for classi cation and data mining tasks. Traditionally, feature selection is done by selecting a minimum number of features that det...
Ke Wang, Suman Sundaresh
KI
2002
Springer
15 years 6 months ago
Description Logics for the Semantic Web
The vision of a Semantic Web has recently drawn considerable attention, both from academia and industry. Description Logics are often named as one of the tools that can support th...
Franz Baader, Ian Horrocks, Ulrike Sattler