Sciweavers

2424 search results - page 53 / 485
» A general algorithm for data dependence analysis
Sort
View
DKE
2002
218views more  DKE 2002»
15 years 2 months ago
Computing iceberg concept lattices with T
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas P...
ECML
1994
Springer
15 years 7 months ago
Estimating Attributes: Analysis and Extensions of RELIEF
In the context of machine learning from examples this paper deals with the problem of estimating the quality of attributes with and without dependencies among them. Kira and Rendel...
Igor Kononenko
ISPD
1998
ACM
89views Hardware» more  ISPD 1998»
15 years 7 months ago
Filling and slotting: analysis and algorithms
In very deep-submicron VLSI, certain manufacturing steps – notably optical exposure, resist development and etch, chemical vapor deposition and chemical-mechanical polishing (CM...
Andrew B. Kahng, Gabriel Robins, Anish Singh, Huij...
INFOCOM
2005
IEEE
15 years 8 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
SIGMETRICS
2010
ACM
214views Hardware» more  SIGMETRICS 2010»
15 years 7 months ago
Distributed sensor network localization from local connectivity: performance analysis for the HOP-TERRAIN algorithm
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
Amin Karbasi, Sewoong Oh