Sciweavers

1920 search results - page 239 / 384
» The Range Constraint: Algorithms and Implementation
Sort
View
ICCAD
1995
IEEE
113views Hardware» more  ICCAD 1995»
15 years 7 months ago
Logic decomposition during technology mapping
—A problem in technology mapping is that the quality of the final implementation depends significantly on the initially provided circuit structure. This problem is critical, es...
Eric Lehman, Yosinori Watanabe, Joel Grodstein, He...
WAW
2004
Springer
178views Algorithms» more  WAW 2004»
15 years 9 months ago
Communities Detection in Large Networks
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
Andrea Capocci, Vito Domenico Pietro Servedio, Gui...
148
Voted
KDD
2000
ACM
97views Data Mining» more  KDD 2000»
15 years 7 months ago
Towards an effective cooperation of the user and the computer for classification
Decision trees have been successfully used for the task of classification. However, state-of-the-art algorithms do not incorporate the user in the tree construction process. This ...
Mihael Ankerst, Martin Ester, Hans-Peter Kriegel
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
15 years 5 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
DEBS
2011
ACM
14 years 7 months ago
Declarative data-driven coordination
Many data-driven social and Web applications involve collaboration and coordination. The vision of declarative data-driven coordination (D3C), proposed in [9], is to support coord...
Johannes Gehrke