Sciweavers

1977 search results - page 110 / 396
» The satisfactory partition problem
Sort
View
ENDM
2010
115views more  ENDM 2010»
15 years 3 months ago
On the knapsack closure of 0-1 Integer Linear Programs
Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constrai...
Matteo Fischetti, Andrea Lodi
INTERSPEECH
2010
15 years 29 days ago
Performance estimation of noisy speech recognition considering recognition task complexity
To ensure a satisfactory QoE (Quality of Experience) and facilitate system design in speech recognition services, it is essential to establish a method that can be used to efficie...
Takeshi Yamada, Tomohiro Nakajima, Nobuhiko Kitawa...
149
Voted
CIKM
2008
Springer
15 years 8 months ago
Achieving both high precision and high recall in near-duplicate detection
To find near-duplicate documents, fingerprint-based paradigms such as Broder's shingling and Charikar's simhash algorithms have been recognized as effective approaches a...
Lian'en Huang, Lei Wang, Xiaoming Li
207
Voted
TKDE
2010
251views more  TKDE 2010»
15 years 26 days ago
Exploring Correlated Subspaces for Efficient Query Processing in Sparse Databases
The sparse data is becoming increasingly common and available in many real-life applications. However, relative little attention has been paid to effectively model the sparse data ...
Bin Cui, Jiakui Zhao, Dongqing Yang
142
Voted
ASPDAC
1999
ACM
77views Hardware» more  ASPDAC 1999»
15 years 10 months ago
Timing-Driven Bipartitioning with Replication Using Iterative Quadratic Programming
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
Shihliang Ou, Massoud Pedram