Sciweavers

136 search results - page 21 / 28
» A Polynomial-Time Algorithm for Global Value Numbering
Sort
View
SIGMOD
2006
ACM
126views Database» more  SIGMOD 2006»
15 years 9 months ago
Constraint chaining: on energy-efficient continuous monitoring in sensor networks
Wireless sensor networks have created new opportunities for data collection in a variety of scenarios, such as environmental and industrial, where we expect data to be temporally ...
Adam Silberstein, Jun Yang 0001, Rebecca Braynard
ICDE
2006
IEEE
154views Database» more  ICDE 2006»
15 years 3 months ago
Efficient Image Classification on Vertically Decomposed Data
Organizing digital images into semantic categories is imperative for effective browsing and retrieval. In large image collections, an efficient algorithm is crucial to quickly cat...
Taufik Abidin, Aijuan Dong, Honglin Li, William Pe...
98
Voted
JMLR
2010
143views more  JMLR 2010»
14 years 8 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...
CIARP
2011
Springer
13 years 9 months ago
A Minority Class Feature Selection Method
Abstract. In many classification problems, and in particular in medical domains, it is common to have an unbalanced class distribution. This pose problems to classifiers as they ...
German Cuaya, Angélica Muñoz-Mel&eac...
LPAR
2005
Springer
15 years 3 months ago
Another Complete Local Search Method for SAT
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
Haiou Shen, Hantao Zhang