Sciweavers

2816 search results - page 122 / 564
» Submodular function minimization
Sort
View
DAC
1994
ACM
15 years 4 months ago
Partitioning Very Large Circuits Using Analytical Placement Techniques
A new partitioningapproach for very largecircuits is described. We demonstrate that applying a recently developed analytical placement algorithm, that pro ts from a linear objecti...
Bernhard M. Riess, Konrad Doll, Frank M. Johannes
IPM
2008
100views more  IPM 2008»
15 years 19 days ago
Query-level loss functions for information retrieval
Many machine learning technologies such as support vector machines, boosting, and neural networks have been applied to the ranking problem in information retrieval. However, since...
Tao Qin, Xu-Dong Zhang, Ming-Feng Tsai, De-Sheng W...
84
Voted
KDD
2003
ACM
130views Data Mining» more  KDD 2003»
16 years 1 months ago
Towards systematic design of distance functions for data mining applications
Distance function computation is a key subtask in many data mining algorithms and applications. The most effective form of the distance function can only be expressed in the conte...
Charu C. Aggarwal
BMCBI
2007
114views more  BMCBI 2007»
15 years 23 days ago
False occurrences of functional motifs in protein sequences highlight evolutionary constraints
Background: False occurrences of functional motifs in protein sequences can be considered as random events due solely to the sequence composition of a proteome. Here we use a nume...
Allegra Via, Pier Federico Gherardini, Enrico Ferr...
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
15 years 2 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin