Sciweavers

36 search results - page 7 / 8
» Minimizing Symmetric Set Functions Faster
Sort
View
ISNN
2005
Springer
13 years 11 months ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
Lei Xu
JMLR
2008
230views more  JMLR 2008»
13 years 5 months ago
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
Michael Collins, Amir Globerson, Terry Koo, Xavier...
MIS
2004
Springer
162views Multimedia» more  MIS 2004»
13 years 11 months ago
Integrating the Results of Multimedia Sub-Queries Using Qualitative Preferences
When similarity queries over multimedia databases are processed by splitting the overall query condition into a set of sub-queries, the problem of how to efficiently and effectiv...
Ilaria Bartolini, Paolo Ciaccia, Vincent Oria, M. ...
JCC
2008
88views more  JCC 2008»
13 years 5 months ago
A self-organizing algorithm for molecular alignment and pharmacophore development
Abstract: We present a method for simultaneous three-dimensional (3D) structure generation and pharmacophorebased alignment using a self-organizing algorithm called Stochastic Prox...
Deepak Bandyopadhyay, Dimitris K. Agrafiotis
CF
2008
ACM
13 years 7 months ago
A distributed evolutionary method to design scheduling policies for volunteer computing
Volunteer Computing (VC) is a paradigm that takes advantage of idle cycles from computing resources donated by volunteers and connected through the Internet to compute large-scale...
Trilce Estrada, Olac Fuentes, Michela Taufer